Decision tree complexity and betti numbers

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 615-624

  Yao, Andrew Chi Chih ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DECISION THEORY; GEOMETRY; MATHEMATICAL MODELS; OPTIMIZATION; SET THEORY; TOPOLOGY; TREES (MATHEMATICS);

ALGEBRAIC COMPUTATIONS; BETTI NUMBERS; COMPACT SETS; LINEAR DECISION TREES; LOWER BOUNDS; TREE COMPLEXITY;

DECISION TREES; COMPUTATIONAL COMPLEXITY;

BETTI NUMBERS; DECISION TREE COMPLEXITY; MEMBERSHIP PROBLEMS;

EID: 0027940782     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195414     Document Type: Conference Paper

References (21)

1. [Be83] M. Ben-Or, "Lower bounds for algebraic computation trees, " Proceedings of 15th STOC, May 1983, 80-86.
2. [Bj92] A. Bjorner, "Subspace arrangements, " in Proceedings of the 1st European Congress of Mathematics, Paris, 1992, edited by A. Joseph and R. Rentschler, Birkhaiiser, Basel-Boston, to appear.
3. [BL92] A. Bjorner and L. Lovasz, "Linear decision trees, subspace arrangements and Mobius functions, " preprint, 1992.
4. [BLY92] A. Bjorner, L. Lovasz, and A. Yao, "Linear decision trees: volume estimates and topological bounds, " Proceedings of 24th STOC, May 1992, 170-177.
5. [BW92] A. Bjorner and V. Welker, "The homology of "k-equal" manifolds and related partition lattices, " Report No. 39, 1991/92, Institute Mittag-Leffler, Stockholm.
6. [BR91] R. Brualdi and H, Ryser, Computational Matrix Theory, Cambridge University Press, Cambridge, 1991.
7. [DL75] D. Dobkin and R.J. Lipton, "On the complexity of computations under varying sets of primitives, " in Lecture Notes in Computer Science, Volume 33, edited by H. Bradhage, Springer-Verlag (1975), 110-117.
8. [GM88] M. Goresky and R. MacPherson, Stratified Morse Theory, Springer-Verlag, New York, 1988.
9. [GKV93] D. Grigoriev, M. Karpinski, and N. Vorobjov, "Complexity lower bounds on testing membership to a polyhedron by algebraic decision trees, " preprint, 1993.
10. [Ha48] M. Hall Jr., "Distinct representatives of subsets, " Bulletin of the American Mathematical Society 54 (1948), 958-961.
11. [Hi75] H. Hironaka, "Triangulation of algebraic sets, " in Proceedings of Symposia in Pure Mathematics, Volume 29 (1975), American Mathematical Society, 165-185.
12. [HS93] G. Hotz and J. Sellen, "On algebraic computation trees and Betti numbers, " Technical Report No. 10/93, Sonderforschungs- bereich 124, Saarbruecken/Kaiserslautern, Germany.
13. [Lu90] A. Lubiw, "A RAM lower bound for the integer distinctness problem, " preprint, 1990.
14. [Mi64] J. Milnor, "On the Betti numbers of real varieties, " Proc. Amer. Math. Soc. 15 (1964), 275-280.
15. O.A. Oleinik, "Estimates of the Betti numbers of real algebraic hypersurfaces, " Mat. Sbornik (N.S.) 28 (1951), 635-640 (in Russian).
16. [OP49] O.A. Oleinik and I.B. Petrovsky, "On the topology of real algebraic surfaces, " Izv. Akad. Nauk SSSR 13 (1949), 389-402 (in Russian). (Transl. Amer. Math. Soc. (1) 7 (1962), 399-417.).
17. [Ro88] J. Rotman, An Introduction to Algebraic Topology, Springer-Verlag, New York, 1988.
18. [St86] R.P. Stanley, Enumerative Combinatorics, Volume 1, Springer-Verlag, New York, 1988.
19. [SY82] M. Steele and A. Yao, "Lower bounds for algebraic decision trees, " J. Algorithms 3 (1982), 1-8.
20. [Th65] R. Thom, "Sur Phomologie des varietes algebriques reelles, " in Differential and Algebraic Topology, edited by S. S. Cairns, Princeton University Press, Princeton, 1965.
21. [Y92] A. Yao, "Algebraic decision trees and Euler characteristics, " Proceedings of 33rd FOCS, October 1992, 268-277.