A Polynomial Decision for 3-SAT
Data Structures and Algorithms
2024-06-11 v3
Abstract
We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or not. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular 3-SAT formula, called pivoted 3-SAT and, after a plain transformation, still keeping the polynomial boundaries, it is shown that 3-SAT formulas can be written as pivoted formulas.
Cite
@article{arxiv.2208.12598,
title = {A Polynomial Decision for 3-SAT},
author = {Angela Weiss},
journal= {arXiv preprint arXiv:2208.12598},
year = {2024}
}
Comments
Revisited version. Short proofs