The following pages link to (Q4717931):
Displayed 11 items.
- Elimination of parameters in the polynomial hierarchy (Q1285590) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
- A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)