Complexity of the CNF-satisfiability problem
Computational Complexity
2018-07-23 v5 Combinatorics
Logic
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.
Cite
@article{arxiv.1804.02478,
title = {Complexity of the CNF-satisfiability problem},
author = {Grigoriy V. Bokov},
journal= {arXiv preprint arXiv:1804.02478},
year = {2018}
}
Comments
4 pages, submitted to the journal Computational complexity