Relativizations of the P=?NP question over the reals (and other ordered rings)

DOI10.1016/0304-3975(94)00068-9zbMath0819.68054OpenAlexW2069138957MaRDI QIDQ1338213

V. Pereyra

Publication date: 27 November 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00068-9

zbMATH Keywords

Blum-Shub-Smale model

Mathematics Subject Classification ID

Stabilization of systems by feedback (93D15) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On Relativizations of the P =? NP Question for Several Structures ⋮ Calculs sur les structures de langage dénombrable

Cites Work

• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Relativizations of the P=?NP question over the reals (and other ordered rings)