@article{Mueller_2020, title={Polynomial Exact-3-SAT-Solving Algorithm}, volume={9}, url={https://www.sciencepubco.com/index.php/ijet/article/view/30749}, DOI={10.14419/ijet.v9i3.30749}, abstractNote={This article describes an algorithm which is supposed by the author to be capable of solving any instance of a 3-SAT CNF in maximal O(n^15), whereby n is the variable index range within the 3-SAT CNF to solve. The presented algorithm imitates the proceeding of an exponential, fail-safe solver. This exponential solver stores internal data in m-SAT clauses, with 3 &lt;= m &lt;= n. The polynomial solver works similarly, but uses 3-SAT clauses only to save the same data. The paper explains how, and proves why this can be achieved. On the supposition the algorithm is correct, the P-NP-Problem would be solved with the result that the complexity classes NP and P are equal.}, number={3}, journal={International Journal of Engineering & Technology}, author={Mueller, Matthias}, year={2020}, month={Aug.}, pages={670–691} }