The following pages link to (Q4228517):
Displaying 7 items.
- Lower bounds on probabilistic linear decision trees (Q1067786) (← links)
- On randomized semi-algebraic test complexity (Q1260656) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
