Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
TL;DR
This paper demonstrates that the CNF-satisfiability problem, traditionally considered NP-complete, can actually be solved in polynomial time using a deterministic Turing machine, challenging prior assumptions.
Contribution
It proves that the CNF-satisfiability problem can be solved in polynomial time, providing a surprising result that contradicts long-standing beliefs about its computational complexity.
Findings
CNF-satisfiability is solvable in polynomial time
Challenges the NP-completeness of SAT
Provides a new approach to Boolean satisfiability
Abstract
This paper is devoted to the complexity of the Boolean satisfiability problem. We consider a version of this problem, where the Boolean formula is specified in the conjunctive normal form. We prove an unexpected result that the CNF-satisfiability problem can be solved by a deterministic Turing machine in polynomial time.
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
TopicsCoding theory and cryptography · semigroups and automata theory · Computability, Logic, AI Algorithms