TL;DR
The paper claims to have developed a polynomial-time algorithm for 3SAT by transforming it into 2SAT problems, asserting a proof that NP equals P.
Contribution
It introduces new concepts and methods to transform 3SAT into 2SAT, claiming to solve 3SAT in polynomial time and prove NP=P.
Findings
Successfully transform 3SAT to 2SAT in polynomial time
Prove that NP equals P based on this transformation
Introduce new concepts like checking tree and contradiction pairs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.