A simplified NP-complete satisfiability problem
@article{Tovey1984ASN,
title={A simplified NP-complete satisfiability problem},
author={C. Tovey},
journal={Discret. Appl. Math.},
year={1984},
volume={8},
pages={85-89}
}3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. When no variable appears in more than three clauses, 3-SAT is trivial and SAT is NPcomplete. When no variable appears in more than two clauses, SAT may be solved in linear time.
Topics from this paper
347 Citations
A Simplified NP-Complete MAXSAT Problem
- Mathematics, Computer Science
- Inf. Process. Lett.
- 1998
- 65
- Highly Influenced
On the Computational Complexity of MaxSAT
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2016
- 3
- PDF
Computational complexity of some restricted instances of 3-SAT
- Computer Science, Mathematics
- Discret. Appl. Math.
- 2007
- 14
- Highly Influenced
- PDF
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities
- Mathematics, Computer Science
- Complexity of Constraints
- 2006
- 7
- PDF
Polynomial Restrictions of SAT: What Can Be Done with an Efficient Implementation of the Davis and Putnam's Procedure?
- Mathematics, Computer Science
- CP
- 1995
- 10
- PDF
A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness
- Computer Science, Mathematics
- Discret. Appl. Math.
- 1994
- 199
References
SHOWING 1-8 OF 8 REFERENCES
On the Complexity of Timetable and Multicommodity Flow Problems
- Mathematics, Computer Science
- SIAM J. Comput.
- 1976
- 1,076
- PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science, Mathematics
- 1978
- 47,337
- PDF
Sci
- Sci
- 1977
On representations of subsets
- J. London Math. Sot
- 1935