Algebraic decision trees and Euler characteristics

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 268-277

  Chi Chih Yao, Andrew ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA MINING;

ALGEBRAIC COMPUTATIONS; EULER CHARACTERISTIC; LINEAR DECISION TREES; SEMI-ALGEBRAIC SET;

DECISION TREES;

EID: 85065717612     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267765     Document Type: Conference Paper

References (22)

1. M. Ben-Or, "Lower bounds for algebraic computation trees," Proceedings of 15th Annual ACM Symposium on Theory of Computing, May 1983, 80-86.
2. A. Bjorner, "Topological methods," in Handbook of Combinatorics, edited by R. Graham, M. Grotschel, and L. Lovasz, North-Holland, to appear.
3. A. Bjorner, L. Lovasz, and A. Yao, "Linear decision trees: volume estimates and topological bounds," Proceedings of 24th Annual ACM Symposium on Theory of Computing, May 1992, 170-177.
4. G. Brumfiel, Partially Ordered Rings and Semi-Algebraic Geometry, Lecture Note Series of the London Math. Soc, Cambridge Univ. Press, Cambridge, 1979.
5. D. Dobkin and R.J. Lipton, "On the com- plexity of computations under varying sets of primitives," in Automata Theory and Formal Languages (edited by H. Bradhage), Lecture Notes in Computer Science, Volume 33, Springer-Verlag (1975), 110-117.
6. M.J. Greenberg and J. Harper, Algebraic Topology: A First Course, Addison-Wesley, 1981.
7. H. Hironaka, "Triangulation of algebraic sets," in Proceedings of Symposia in Pure Mathematics, Volume 29 (1975), American Mathematical Society, 165-185.
8. M. Hirsch, "Lower bounds for the non- linear complexity of algebraic computation trees with integer inputs," preprint, May 1991.
9. E. Kalinova, The localization problem in geometry and Rabin-Spira linear proofs (Czech), M. Sci. thesis, Universitas Carolina, Prague, 1978.
10. S. Lefschetz and J.H.C. Whitehead, "On analytical complexes," Trans. Amer. Math. Soc. 35 (1933), 510-517.
11. S. Lojasiewicz, "Triangulations of semi- analytic sets," Ann. Scu. Norm, di Pisa, 18 (1964), 449-474.
12. Y. Mansour, B. Schieber, and P. Tiwari, "Lower bounds for integer greatest common divisor computations," Proceedings of 29th IEEE Symposium on Foundations of Computer Science, 1988, 54-63.
13. J. Milnor, "On the Betti numbers of real va- rieties," Proc. Amer. Math. Soc. 15 (1964), 275-280.
14. J. Moravek, "A localization problem in ge- ometry and complexity of discrete programming," Kybernetika (Prague) 8 (1972), 498-516.
15. J. Moravek and P. Pudlak, "New lower bound for polyhedral membership problem with an application to linear programming," in Mathematical Foundations of Computer Science (edited by M.P. Chytil and V. Koubek), Lecture Notes in Computer Science, Volume 176, Springer-Verlag (1984), 416-424.
16. J. Munkres, Elements of Algebraic Topol- ogy, Addison-Wesley, 1984.
17. S. Smale, "On the topology of algorithms," Preprint, University of California, Berkeley, 1987.
18. M. Steele and A. Yao, "Lower bounds for algebraic decision trees," J. Algorithms 3 (1982), 1-8.
19. V. Strassen, "The computational complex- ity of continued fractions," SIAM J. on Computing 12 (1983), 1-27.
20. R. Thorn, "Sur l'homologie des varietes algebriques reelles," in Differential and Algebraic Topology, edited by S. S. Cairns, Princeton University Press, Princeton, 1965.
21. J.W. Vick, Homology Theory, Academic Press, New York, 1973.
22. A. Yao and R. Rivest, "On the polyhedral decision problem," SIAM J. on Computing 9 (1980), 343-347.