Pages that link to "Item:Q1386178"
From MaRDI portal
The following pages link to A lower bound for randomized algebraic decision trees (Q1386178):
Displaying 9 items.
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- On randomized semi-algebraic test complexity (Q1260656) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Complexity lower bounds for randomized computation trees over zero characteristic fields (Q1587344) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- Element distinctness revisited (Q1993785) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- (Q4228517) (← links)