A Polynomial Decision for 3-SAT

We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or no. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular \thsat\ formula, called pivoted 3-SAT and, after a plain transformation, still keeping the polynomial boundaries, it is shown that \thsat\ formulas can be written as pivoted formulas.