A Polynomial Decision for 3-SAT

TL;DR

This paper introduces a polynomial-time and space method for deciding the satisfiability of 3-SAT formulas by transforming them into a special pivoted form, simplifying the decision process.

Contribution

It presents a novel polynomially bounded approach to determine 3-SAT satisfiability using simple tools and transformations.

Findings

Decides satisfiability for pivoted 3-SAT formulas in polynomial time

Transforms general 3-SAT formulas into pivoted form within polynomial bounds

Provides a new polynomial decision procedure for 3-SAT

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.