Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over ℂ, ℝ, and ℤ

07/06/2021

∙

by   Ali Çivril, et al.

∙

0

∙

share

We show that the problem of determining the feasibility of quadratic systems over ℂ, ℝ, and ℤ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.