The complexity of satisfiability problems

  title={The complexity of satisfiability problems},
  author={Thomas J. Schaefer},
  journal={Proceedings of the tenth annual ACM symposium on Theory of computing},
  • T. Schaefer
  • Published 1 May 1978
  • Mathematics
  • Proceedings of the tenth annual ACM symposium on Theory of computing
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied. I t is known that, when restricted to formulas having only two literals per clause, this problem has an efficient (polynomial-time) solution. But the same problem on formulas having three literals per clause is NP-complete, and hence probably does not have any efficient solution. In this paper, we consider an infinite class of satisfiability problems which contains… 

Complexity of Generalized Satisfiability Counting Problems

A Dichotomy Theorem is proved that if all logical relations involved in a generalized satisfiability counting problem are affine then the number of satisfying assignments of this problem can be computed in polynomial time, otherwise this function is #P-complete.

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems

It is shown that NAESAT can be decided in linear time for monotone formulas in which each clause has length exactly k and each variable occurs exactly k times, and bicolorability of k-uniform, k-regular hypergraphs is decidable inlinear time.

Dichotomy Theorem for the Generalized Unique Satisfiability Problem

This paper presents a dichotomy theorem for the unique satisfiability problem, partitioning the instances of the problem between the polynomial-time solvable and coNP-hard cases and noticing that the additional knowledge of a model makes this problem co NP-complete.

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?

For us central family of algorithmic problems, parameterized by aconstraint language Γ, now is the problem to determinesatisfiability of a given Γ-formula, denoted by Csp(Γ).

Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms

An exact algorithm is presented for Maximum Exact Satisfiability where each clause contains at most two literals with time complexity O(poly(L) .

A perspective on certain polynomial-time solvable classes of satisfiability

Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas

This paper proves dichotomy theorems for alternation-bounded quantified generalized Boolean formulas by showing that these problems are either $\Sigma_i^p$-complete or in P, and gives a simple criterion to determine which of the two cases holds.

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

Classes of inputs that are induced by Boolean constraint languages that Schaefer [1978] identified as the maximal constraint languages with a tractable satisfiability problem are focused on.

A Proof of the CSP Dichotomy Conjecture

This article presents an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.



Complete problems for deterministic polynomial time

Several problems which are complete for P, the class of languages recognizable in deterministic polynomial time, are introduced, to serve to differentiate those sets in P which are not recognizable in logarithmic space from those which are, providing such differentiation is possible.

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a

Word problems requiring exponential time(Preliminary Report)

A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.

Space-Bounded Reducibility among Combinatorial Problems

  • N. Jones
  • Computer Science, Mathematics
    J. Comput. Syst. Sci.
  • 1975

A Computing Procedure for Quantification Theory

In the present paper, a uniform proof procedure for quantification theory is given which is feasible for use with some rather complicated formulas and which does not ordinarily lead to exponentiation.

A note on disjunctive form tautologies

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

The Polynomial-Time Hierarchy

  • L. Stockmeyer
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1976

Complexity of decision problems based on finite two-person perfect-information games

We present a number of simply-structured combinatorial games for which the problem of determining the outcome of optimal play is complete in polynomial space—a condition which gives very strong

Reducibility Among Combinatorial Problems

  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.