论文信息 - Decision tree complexity and Betti numbers

Decision tree complexity and Betti numbers

We show that any algebraic computation tree or any fixed-degree algebraic tree for solving the membership question of a compact set S ~ R“ must have height greater than Cl(log(@i(S))) – cn for each i, where pi(S) is the i-th Betti number. This generalizes a well-known result by Ben-Or [Be83] who proved this lower bound for the case i = O, and a recent result by Bjorner and Lovtisz [BL92] who proved this lower bound for all i for linear decision trees.

Andrew Chi-Chih Yao

[1] J. Michael Steele,et al. Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.

[2] Marek Karpinski,et al. Lower bounds on testing membership to a polyhedron by algebraic decision trees , 1994, STOC '94.

[3] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[4] Andrew Chi-Chih Yao. Algebraic Decision Trees and Euler Characteristics , 1992, FOCS.

[5] László Lovász,et al. Linear decision trees, subspace arrangements and Möbius functions , 1994 .

[6] J. Milnor. On the Betti numbers of real varieties , 1964 .

[7] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[8] M. Goresky,et al. Stratified Morse theory , 1988 .

[9] M. Hall. Distinct representatives of subsets , 1948 .

[10] Volkmar Welker,et al. The Homology of "k-Equal" Manifolds and Related Partition Lattices , 1995 .

[11] László Lovász,et al. Linear decision trees: volume estimates and topological bounds , 1992, STOC '92.

[12] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.