arXiv:1004.3702 · v98

A Polynomial time Algorithm for 3SAT

首次提交 2010-04-12 12:39

版本更新 2026-10-29 20:52

雷达观测 2026-10-30 13:28

摘要

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.

作者备注：35 pages. This time, I add a detailed polynomial time algorithm and proof for 3SAT