Complexity of the CNF-satisfiability problem
From MaRDI portal
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.
This page was built for publication: Complexity of the CNF-satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300044)
