Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$

Documenti analoghi

• Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
  di: Çivril, Ali
  Pubblicazione: (2021)
• Scheme-Theoretic Approach to Computational Complexity. III. SETH
  di: Çivril, Ali
  Pubblicazione: (2023)
• Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation
  di: Çivril, Ali
  Pubblicazione: (2023)
• Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete
  di: Binnendyk, Eric
  Pubblicazione: (2025)
• Representing Matroids over the Reals is $\exists \mathbb R$-complete
  di: Kim, Eun Jung, et al.
  Pubblicazione: (2023)