Deterministic Polynomial Solution for NP based on a Mechanical Process of Understanding
Alejandro Sánchez Guinea · arXiv (Cornell University) · 2015
We propose a deterministic algorithm that avoids brute-force search in solving 3SAT and provides efficient solution to any instance of this problem. The algorithm solves a problem instance based on building an understanding on how the context of each literal (viz., the rest of the instance and the problem definition) makes the literal be related to a specific truth value. We show that based on the proposed algorithm it is possible to solve efficiently the problems in the class NP of decision problems.