The complexity of satisfiability problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1978, Pages 216-226

  Schaefer, Thomas J ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CALMA ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY;

CONJUNCTIVE NORMAL FORMS; LITERALS; LOG SPACE; NP COMPLETE; POLYNOMIAL SPACE; POLYNOMIAL-TIME; PROPOSITIONAL FORMULAS; SATISFIABILITY PROBLEMS;

POLYNOMIAL APPROXIMATION;

EID: 85047875192     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800133.804350     Document Type: Conference Paper

References (11)

1. M. Bauer, D. Brand, M. Fischer, A. Meyer and M. Paterson, A note on disjunctive form tautologies, SIGACT News April 1973, pp. 17-20.
2. S.A. Cook, The complexity of theorem-proving procedures, Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
3. M. Davis and H. Putnam, A computing procedure for quantification theory, JACM 7 (1960) pp. 201-215.
4. N.D. Jones, Space-bounded reducibility among combinatorial problems, J. Comp. Sys. Sci. 11 (1975) pp. 68-85.
5. N.D. Jones and W.T. Laaser, Complete problems for deterministic polynomial time, Sixth Ann. ACM Symp. on Theory of Comp., 1974 pp. 40-46.
6. R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, R.W. Miller and J.W. Thatcher eds., Plenum Press, New York, 1972, pp. 85-104.
7. E.L. Post, The two-valued iterative systems of mathematical logic. Annals of Math. Studies, vol. 5, Princeton, 1941.
8. W. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comp. Sys. Sci. 4 (1970), pp. 177-192.
9. T. J. Schaefer, Complexity of decision problems based on finite two-person perfect-information games, 8th Ann. ACM Symp. on Theory of Comp., 1976, pp. 41-49.
10. L.J. Stockmeyer, The polynomial-time hierarchy. Theor. Comp. Sci. 3 (1976), pp. 1-22.
11. L.J. Stockmeyer and A.R. Meyer, Word problems requiring exponential time: preliminary report, 5th Annual ACM Symp. on Theory of Computing, 1973, pp. 1-9.