论文标题
部分可观测时空混沌系统的无模型预测
A Polynomial Decision for 3-SAT
论文作者
论文摘要
我们提出了一种在时间和空间中的多项式界限，以决定给定的3-SAT公式是否满足。实际上，我们在这里使用的工具非常简单。我们首先确定特定的3-SAT公式的满意度，称为3-SAT，并且在简单的转换后仍保持多项式边界，这表明3-SAT公式可以写成枢纽公式。
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.
