Pages that link to "Item:Q1260656"

The following pages link to On randomized semi-algebraic test complexity (Q1260656):

Displaying 5 items.

• 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)
• A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545) (← links)