A Polynomial time Algorithm for 3SAT
Data Structures and Algorithms
2026-04-23 v97
Abstract
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.
Cite
@article{arxiv.1004.3702,
title = {A Polynomial time Algorithm for 3SAT},
author = {Lizhi Du},
journal= {arXiv preprint arXiv:1004.3702},
year = {2026}
}
Comments
33 pages. This time, I add a detailed polynomial time algorithm and proof for 3SAT