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}
}
  • C. Tovey
  • Published 1984
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 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. 
    347 Citations
    A Simplified NP-Complete MAXSAT Problem
    • 65
    • Highly Influenced
    #2,2-SAT is solvable in linear-time
    Monotone 3-Sat-4 is NP-complete
    • 3
    • PDF
    On the Computational Complexity of MaxSAT
    • M. E. Halaby
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2016
    • 3
    • PDF
    Non-Interlaced SAT is in P
    • PDF
    Computational complexity of some restricted instances of 3-SAT
    • 14
    • Highly Influenced
    • PDF
    A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness
    • 199
    Restricted Poly-Time SAT-Solvable CNF’s
    • PDF

    References

    SHOWING 1-8 OF 8 REFERENCES
    The Euclidean Traveling Salesman Problem is NP-Complete
    • 603
    On the Complexity of Timetable and Multicommodity Flow Problems
    • 1,076
    • PDF
    The complexity of theorem-proving procedures
    • S. Cook
    • Mathematics, Computer Science
    • STOC '71
    • 1971
    • 6,152
    • PDF
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,337
    • PDF
    On Representatives of Subsets
    • 1,693
    • PDF
    Fundamentals of Computer Algorithms
    • 1,333
    • PDF
    Sci
    • Sci
    • 1977
    On representations of subsets
    • J. London Math. Sot
    • 1935