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

07/06/2021
by   Ali Çivril, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro