Pages that link to "Item:Q3140550"
From MaRDI portal
The following pages link to On the Complexity of Quantifier Elimination: the Structural Approach (Q3140550):
Displaying 14 items.
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← 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)
- Real computations with fake numbers (Q1599196) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- A note on parallel and alternating time (Q2465291) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Some Results on Interactive Proofs for Real Computations (Q3195685) (← links)
- On Relativizations of the P =? NP Question for Several Structures (Q4918006) (← links)
