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.
arXiv comments
35 pages. This time, I add a detailed polynomial time algorithm and proof for 3SAT
The paper on arxiv, if anyone wants to spot the error: https://arxiv.org/pdf/1004.3702.pdf
jtsiskinView on HNParent context
An earlier version (2010) of the paper in arXiv: https://arxiv.org/pdf/1004.3702.pdf
cscurmudgeonView on HNParent context