Three complete deterministic polynomial algorithms for 3SAT
Computational Complexity
2019-12-16 v6
Abstract
Three algorithms are presented that determine the existence of satisfying assignments for 3SAT Boolean satisfiability expressions. One algorithm is presented for determining an instance of a satisfying assignment, where such exists. The algorithms are each deterministic and of polynomial complexity. The algorithms determining existence are complete as each produces a certificate of non-satisfiability, for instances where no satisfying assignment exists, and of satisfiability for such assignment does exist.
Cite
@article{arxiv.cs/0205064,
title = {Three complete deterministic polynomial algorithms for 3SAT},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:cs/0205064},
year = {2019}
}
Comments
18 Pages; 7 Figures; Paper is a revision, correction, and expansion 2002 version; Example using prior algorithm version failure case in appendices