Three complete deterministic polynomial algorithms for 3SAT
<|reference_start|>Three complete deterministic polynomial algorithms for 3SAT: 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.<|reference_end|>
@article{sauerbier2002three,
    title={Three complete deterministic polynomial algorithms for 3SAT},
    author={Charles Sauerbier},
    journal={arXiv preprint arXiv:cs/0205064},
    year={2002},
    number={3SEA-2019-12},
    archivePrefix={arXiv},
    eprint={cs/0205064},
    primaryClass={cs.CC}
}