Pages that link to "Item:Q1338216"

The following pages link to Computing over the reals with addition and order (Q1338216):

Displayed 16 items.

• On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) ‎ (← links)
• A hierarchy below the halting problem for additive machines (Q1015375) ‎ (← links)
• Exotic quantifiers, complexity classes, and complete problems (Q1022429) ‎ (← links)
• Dynamical recognizers: real-time language recognition by analog computers (Q1129007) ‎ (← links)
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) ‎ (← links)
• Saturation and stability in the theory of computation over the reals (Q1304539) ‎ (← links)
• Separation of complexity classes in Koiran's weak model (Q1338212) ‎ (← links)
• On the computational power of dynamical systems and hybrid systems (Q1349871) ‎ (← links)
• Generalized Knapsack problems and fixed degree separations (Q1351965) ‎ (← links)
• On NP-completeness for linear machines (Q1368835) ‎ (← links)
• On the computational structure of the connected components of a hard problem (Q1607000) ‎ (← links)
• On the P-NP problem over real matrix rings (Q1884926) ‎ (← 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)
• <i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures (Q5313380) ‎ (← links)
• On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) ‎ (← links)