Investigations on autark assignments
- 21 December 2000
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 107 (1-3) , 99-137
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- New methods for 3-SAT decision and worst-case analysisTheoretical Computer Science, 1999
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problemScience China Technological Sciences, 1997
- Recognizing renamable generalized propositional Horn formulas is NP-completeDiscrete Applied Mathematics, 1995
- Recognition of q-Horn formulae in linear timeDiscrete Applied Mathematics, 1994
- Tautologies and positive solvability of linear homogeneous systemsAnnals of Pure and Applied Logic, 1992
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulasJournal of Combinatorial Theory, Series A, 1986
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942
- On the Abstract Properties of Linear DependenceAmerican Journal of Mathematics, 1935