We lay the foundations of a new theory for algorithms and computational complexity by parameterizing the instances of a computational problem as a moduli scheme. Considering the geometry of the scheme associated to 3-SAT, we separate P and NP.

翻译：我们通过将计算问题实例作为模式方案参数化,为算法和计算复杂性的新理论打下基础。 考虑到与3SAT相关计划的几何性,我们将P和NP分开。