DSApr 22
A Polynomial time Algorithm for 3SAT
arXiv:1004.370245.81 citationsh-index: 2
AI Analysis
This claims to solve a foundational problem in computer science, potentially revolutionizing complexity theory.
The authors tackled the 3SAT problem by transforming it into 2SAT problems in polynomial time, resulting in a proof that NP=P.
By creating some new concepts and methods: checking tree, long unit path, direct contradiction unit pair, indirect contradiction unit pair, additional contradiction unit pair, 2-unit layer and 3-unit layer, redundant units, and destroying parallel pairs , we successfully transform solving a 3SAT problem to solving 2SAT problems in polynomial time. Thus we proved that NP=P.