TY - JOUR
AU - Mueller, Matthias
TI - Polynomial Exact-3-SAT-Solving Algorithm
PY - 2020/08/04
Y2 - 2024/09/10
JF - International Journal of Engineering & Technology
JA - IJET
VL - 9
IS - 3
SE - Articles
LA -
DO - 10.14419/ijet.v9i3.30749
UR - https://doi.org/10.14419/ijet.v9i3.30749
SP - 670-691
AB - 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 <= m <= 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.
ER -