Computing over the reals with addition and order: Higher complexity classes
From MaRDI portal
Publication:1908895
DOI10.1006/jcom.1995.1018zbMath0843.68033OpenAlexW2007014039WikidataQ57733301 ScholiaQ57733301MaRDI QIDQ1908895
Publication date: 5 May 1996
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1995.1018
Related Items
Complexity and dimension, Generalized Knapsack problems and fixed degree separations, On NC-real complexity classes for additive circuits and their relations with NC, Computation over algebraic structures and a classification of undecidable problems, Machines Over the Reals and Non-Uniformity, An explicit solution to Post's problem over the reals, Kolmogorov Complexity Theory over the Reals, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF, On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture, A hierarchy below the halting problem for additive machines, Exotic quantifiers, complexity classes, and complete problems, Computability Over Structures of Infinite Signature, Saturation and stability in the theory of computation over the reals, Real computations with fake numbers, Transfer theorems via sign conditions, On the computational structure of the connected components of a hard problem