Pages that link to "Item:Q1260656"
From MaRDI portal
The following pages link to On randomized semi-algebraic test complexity (Q1260656):
Displaying 9 items.
- On certain computable tests and componentwise error bounds (Q685872) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Complexity bounds for zero-test algorithms (Q2457383) (← links)
- A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)
- (Q3113771) (← links)
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence (Q6061982) (← links)