Pages that link to "Item:Q677021"
From MaRDI portal
The following pages link to Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021):
Displaying 6 items.
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Decision trees: Old and new results. (Q1854291) (← links)
- Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657) (← links)
- A new method for proving lower bounds in the model of algebraic decision trees (Q3979281) (← links)
- Linear Decision Trees, Subspace Arrangements, and Mobius Functions (Q4305906) (← links)