Lower Bounds for Algebraic Decision Trees

@article{Steele1982LowerBF,
  title={Lower Bounds for Algebraic Decision Trees},
  author={J. Steele and A. Yao},
  journal={J. Algorithms},
  year={1982},
  volume={3},
  pages={1-8}
}
A topological method is given for obtaining lower bounds for the height of algebraic decision trees. The method is applied to the knapsack problem where an Ω(n2) bound is obtained for trees with bounded-degree polynomial tests, thus extending the Dobkin-Lipton result for linear trees. Applications to the convex hull problem and the distinct element problem are also indicated. Some open problems are discussed. 
Lower bounds for algebraic computation trees
  • M. Ben-Or
  • Computer Science, Mathematics
  • STOC '83
  • 1983
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems
Lower bounds for algebraic computation trees with integer inputs
  • A. Yao
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
Lower Bounds for Combinatorial Problems on Graphs
A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees
  • J. Seiferas
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1988
Decision Tree Complexity and Betti Numbers
  • A. Yao
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1997
Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
  • M. D. Hirsch
  • Mathematics, Computer Science
  • computational complexity
  • 2005
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems
  • D. Dobkin
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1976
A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem
On the Polyhedral Decision Problem
On the complexity of comparison problems using linear functions
  • A. Yao
  • Mathematics, Computer Science
  • 16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
A Lower Bound to Finding Convex Hulls
  • A. Yao
  • Mathematics, Computer Science
  • JACM
  • 1981
Computing the Maximum and the Median
On the Betti numbers of real varieties
Proving Simultaneous Positivity of Linear Forms
  • M. Rabin
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1972
A lower bound on
...
1
2
...