Dichotomy theorem for the generalized unique satisfiability problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 327-337

  Juban, Laurent ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ADDITIONAL KNOWLEDGE; DICHOTOMY THEOREM; POLYNOMIAL CASE; POLYNOMIAL-TIME; PROPOSITIONAL FORMULAS; SATISFIABILITY PROBLEMS; UNIQUE SATISFIABILITY;

FORMAL LOGIC;

EID: 84956859641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_27     Document Type: Conference Paper

References (13)

1. K. A. Berman, J. Franco, and J. S. Schlipf. Unique satisfiability of Horn sets can be solved in nearly linear time. Discrete Applied Mathematics, 60(1-3):77-91, 1995.
2. A. Blass and Y. Gurevich. On the unique satisfiability problem. Information and Control, 55(1-3):80-88, 1982.
3. N. Creignou and M. Hermann. Complexity of generalized satisfiability counting problems. Information and Computation, 125(1):1-12, 1996.
4. R. Chang, J. Kadin, and P. Rohatgi. On unique satisfiability and the threshold behavior of randomized reductions. Journal of Computer and System Science, 50(3):359-373, 1995.
5. W. F. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3):267-284, 1984.
6. M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co, 1979.
7. P. Hansen and B. Jaumard. Uniquely solvable quadratic Boolean equations. Discrete Applied Mathematics, 12(2):147-154, 1985.
8. D. C. Kozen. The design and analysis of algorithms, chapter 26: Counting problems and #P, pages 138-143. Springer-Verlag, 1992.
9. M. Minoux. The unique Horn-satisfiability problem and quadratic Boolean equations. Annals of Mathematics and Artificial Intelligence, 6(1-3):253-266, 1992.
10. C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
11. D. Pretolani. A linear time algorithm for unique Horn satisfiability. Information Processing Letters, 48(2):61-66, 1993.
12. T. J. Schaefer. The complexity of satisfiability problems. In Proceedings 10th Symposium on Theory of Computing (STOC'78), San Diego (California, USA), pages 216-226, 1978.
13. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85-93, 1986.