Pages that link to "Item:Q1304539"

The following pages link to Saturation and stability in the theory of computation over the reals (Q1304539):

Displaying 12 items.

• On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
• VPSPACE and a transfer theorem over the complex field (Q1034531) (← links)
• Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
• A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151) (← links)
• Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
• An explicit solution to Post's problem over the reals (Q2479313) (← links)
• On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067) (← links)
• Algorithms yield upper bounds in differential algebra (Q5879624) (← links)
• Weak arithmetics (Q5941252) (← links)
• Weak arithmetic (Q5941732) (← links)