Computing over the reals with addition and order: Higher complexity classes
From MaRDI portal
Recommendations
Cited in
(26)- A hierarchy below the halting problem for additive machines
- Exotic quantifiers, complexity classes, and complete problems
- Saturation and stability in the theory of computation over the reals
- Computing over the reals with addition and order
- Generalized Knapsack problems and fixed degree separations
- Real data-integer solution problems within the Blum-Shub-Smale computational model
- Real computations with fake numbers
- Transfer theorems via sign conditions
- On the computational structure of the connected components of a hard problem
- An explicit solution to Post's problem over the reals
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Complexity and dimension
- TIME BOUNDED COMPUTATIONS OVER THE REALS
- Computability Over Structures of Infinite Signature
- scientific article; zbMATH DE number 1257074 (Why is no real title available?)
- Machines Over the Reals and Non-Uniformity
- Computation over algebraic structures and a classification of undecidable problems
- On the computing power of +, -, and
- Kolmogorov Complexity Theory over the Reals
- scientific article; zbMATH DE number 1418322 (Why is no real title available?)
- On NC-real complexity classes for additive circuits and their relations with NC
- A theory of complexity, condition, and roundoff
- Exotic Quantifiers, Complexity Classes, and Complete Problems
- Logical Approaches to Computational Barriers
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture
- The path-bifurcation hierarchy does not collapse to ^1 in infinite abelian groups
This page was built for publication: Computing over the reals with addition and order: Higher complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908895)
