Determining satisfiability of 3-SAT in polynomial time
Data Structures and Algorithms
2020-07-02 v9
Abstract
In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient versions are practical with respect to today's hardware. We accompany this paper with a serial version of the algorithm without non-trivial efficiencies (link: polynomial3sat.org).
Cite
@article{arxiv.1903.10081,
title = {Determining satisfiability of 3-SAT in polynomial time},
author = {Ortho Flint and Asanka Wickramasinghe and Jason Brasse and Christopher Fowler},
journal= {arXiv preprint arXiv:1903.10081},
year = {2020}
}
Comments
The ninth version is the version submitted to peer review. ArXiv does not allow antiquated versions to be removed