TL;DR
This paper establishes that the SAT problem cannot be solved in polynomial time by any deterministic algorithm, highlighting its computational complexity.
Contribution
It provides a proof that deterministic polynomial-time algorithms for SAT do not exist, confirming the problem's NP-completeness.
Findings
No deterministic polynomial-time algorithm for SAT
Supports the NP-completeness of SAT
Highlights the computational difficulty of SAT
Abstract
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization