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.

翻译：我们提出一种时间和空间复杂度均为多项式有界的方法，用于判定给定3-SAT公式是否可满足。本文所采用的工具实际上非常简单。我们首先判定一类被称为枢轴3-SAT的特殊3-SAT公式的可满足性，随后通过简单的变换（仍保持多项式边界条件）证明：所有3-SAT公式均可转换为枢轴公式形式。