SAT-problems and reductions with respect to the number of variables

Journal of Logic and Computation

Volumn 7, Issue 4, 1997, Pages 457-471

  Grandjean, Etienne ^a   Büning, Hans Kleine ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042418763     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.4.457     Document Type: Article

References (23)

1. A. Blass and Y. Gurevich. On the unique satisfiability problem. Information and Computation, 55, 80-88, 1982.
2. R. Chang and J. Kadin. On the Structure of Uniquely Satisfiable Formulas. Technical Report TR 90-1124, Department of Computer Science, Cornell University, Ithaca, NY, 1990.
3. R. Chang and R. Rohatgi. On unique satisfiability and randomized reductions. Bulletin of the EATCS, 42, 151-159, 1990.
4. S. A. Cook. The complexity of theorem proving procedures. In Proceedings of the 3rd Symposium on Theory of Computing, pp. 151-158, 1971.
5. S. A. Cook. Short prepositional formulas represent nondeterministic computations. Information Processing Letters, 26, 269-270, 1988.
6. N. Creignou. The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness. In Proceedings of the 6th Workshop on Computer Science Logic, pp. 115-133. Vol. 702 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1993. Also in revised form in Theoretical Computer Science, 145, 111-145, 1995.
7. N. Creignou. The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness. In Proceedings of the 6th Workshop on Computer Science Logic, pp. 115-133. Vol. 702 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1993. Also in revised form in Theoretical Computer Science, 145, 111-145, 1995.
8. A. K. Dewdney. Linear time transformations between combinatorial problems. International Journal of Computer Mathematics, 11, 91-110, 1982.
9. R. Fagin. Generalized first-order spectra and polynomial-time recognizable set. Complexity of Computation: Proceedings of a Symposium in Applied Mathematics, R. M. Karp, ed. SIAM-AMS Proceedings, VII, 43-73, 1974.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
11. E. Grandjean. Linear time algorithms and NP-complete problems. SIAM Journal on Computing, 23, 573-597, 1994.
12. E. Grandjean. Sorting, linear time, and the satisfiability problem. To appear in Annals of Mathematics and Artificial Intelligence.
13. Y. Gurevich and S. Shelah. Nearly linear time. pp. 108-118. Vol. 363 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1989.
14. H. B. Hunt and R.E. Stearns. The complexity of very simple boolean formulas with applications. SIAM Journal on Computing, 19, 44-70, 1990.
15. R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds. pp. 85-104. Plenum Press, New York, 1972.
16. n steps. Discrete Applied Mathematics, 10, 287-295, 1985.
17. C. H. Papadimitriou. On the complexity of unique solutions. Journal of the ACM, 31, 392-400, 1984.
18. C. H. Papadimitriou and D. Wolfe. The Complexity of Facets Resolved. Journal of Computer and System Sciences, 37, 2-13, 1988.
19. J. M. Robson. An O(T log T) reduction from RAM computations to satisfiability. Theoretical Computer Science, 82, 141-149, 1991.
20. n Steps. In Proceedings of the 6th Workshop on Computer Science Logic, pp. 379-394. Vol. 702 of Lecture Notes in Computer Science, Springer Verlag, Berlin, 1993.
21. C. P. Schnorr. Satisfiability is quasilinear complete in NQL. Journal of the ACM, 25, 136-145, 1978.
22. G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part II, A. O. Silenko, ed. pp. 115-125, 1970.
23. L. G. Valiant, V. V. Vazarani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47, 85-93, 1986.