A note on disjunctive form tautologies

Authors:
M. Bauer;D. Brand;M. Fischer;A. Meyer;M. Paterson
Affiliations:
University of Toronto;University of Toronto;Massachusetts Institute of Technology;Massachusetts Institute of Technology;University of Warwick
Venue:
ACM SIGACT News
Year:
1973

Citing 1
Cited 1

The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

A new 3-CNF transformation by parallel-serial graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cook [1] and Karp [2] have shown that a large class of combinatorial decision problems can be solved in time bounded by a polynomial in the size of the problem iff there is a polynomial time procedure for deciding whether a disjunctive formula with at most three literals per disjunct in the propositional calculus is a tautology.