A Polynomial time Algorithm for 3SAT
cs.DS
Submitted: 2010-04-12
Updated: 2026-10-29
Comments: 35 pages. This time, I add a detailed polynomial time algorithm and proof for 3SAT
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles