Pages that link to "Item:Q1908895"
From MaRDI portal
The following pages link to Computing over the reals with addition and order: Higher complexity classes (Q1908895):
Displaying 22 items.
- Complexity and dimension (Q287068) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- A hierarchy below the halting problem for additive machines (Q1015375) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- Generalized Knapsack problems and fixed degree separations (Q1351965) (← links)
- Real data-integer solution problems within the Blum-Shub-Smale computational model (Q1368838) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Transfer theorems via sign conditions (Q1603522) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Computability Over Structures of Infinite Signature (Q4210842) (← links)
- Machines Over the Reals and Non-Uniformity (Q4336697) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- (Q4941884) (← links)
- On NC-real complexity classes for additive circuits and their relations with NC (Q5096867) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Logical Approaches to Computational Barriers (Q5898821) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
