A Polynomial Algorithm for 3-sat
Michael Weiss · 2012
We present a new method for solving 3-sat formulas. In this method, the formulas are grouped in digraphs representing unsatisfiable 2-sat formulas in which we decide satisfiability of the whole formula. We show that using this method we polynomially decide if a given formula 3-sat is satisfiable or not, solving, in this way, the classic question whether P = NP.