On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 408-417

  Basu, Saugata ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; ALGORITHMS; BOOLEAN ALGEBRA; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; NUMBER THEORY; POLYNOMIALS; THEOREM PROVING; TOPOLOGY;

BETTI NUMBERS; BOOLEAN FORMULAE; CONNECTED COMPONENT; EULER CHARACTERISTIC; EXPONENTIAL TIME ALGORITHM; SEMI-ALGEBRAIC SET; SEMI-ALGEBRAIC SETS; TWO DIRECTIONS;

BOOLEAN ALGEBRA; SET THEORY;

BETTI NUMBERS; EULER CHARACTERISTICS; HOMOLOGY GROUPS; SEMI ALGEBRAIC SETS; TOPOLOGICAL COMPLEXITY;

EID: 0029702965     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237988     Document Type: Conference Paper

References (26)

1. E. ARTIN, H. BRAUN Introduction to Algebraic Topology, Charles E. Merrill Publishing, Columbus, Ohio, (1969).
2. J. BOCHNAK, M. COSTE, M.-F. ROY Géométrie algébrique réelle. Springer-Verlag (1987).
3. M. BEN-OR Lower Bounds for Algebraic Computation Trees, Proc. 15th STOC, 80-86, (1983).
4. S. BASU, R. POLLACK, M.-F. ROY A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials in "Quantifier Elimination and Cylindrical Algebraic Decomposition", B. Caviness and J. Johnson Eds., Springer Verlag, to appear.
5. S. BASU, R. POLLACK, M.-F. ROY On the combinatorial and algebraic complexity of Quantifier Elimination, Proc. 35th IEEE Symp. on Foundations of Computer Science, 632-642, (1994) (full version to appear in the JACM).
6. S. BASU, R. POLLACK, M.-F. ROY. Computing points meeting every cell on a variety. In The First Workshop on the Algorithmic Foundations of Robotics, Randy Wilson and Jean-Claude Latombe Eds., A. K. Peters, Boston, MA, (1994).
7. S. BASU, R. POLLACK, M.-F. ROY On the Number of Cells Defined by a Family of Polynomials on a Variety, to appear in Mathematika.
8. J. CANNY, Computing road maps in general semialgebraic sets, the Computer Journal, 36:504-514, (1993).
9. B. CHAZELLE Computational Geometry: A Retrospective, Proc. 36th STOC, 75-94, (1994).
10. G. E. COLLINS, Quantifier elimination for real closed fields by cylindrical algebraic decomposition Springer Lecture Notes in Computer Science 33, 515-532.
11. M. GORESKY, R. MACPHERSON Stratified Morse Theory, Springer-Verlag, (1987).
12. J. E. GOODMAN, R. POLLACK, R. WENGER, Bounding the Number of Geometric Permutations Induced by k-transversals, Proc. 10th Annual Symposium on Computational Geometry, (1994) (journal version to appear in the Journal of Combinatorial Theory, Series A).
13. D. GRIGOR'EV, N. VOROBJOV Counting connected components of a semi-algebraic set in subexponential time. Comput. Complexity, 2:133-186 (1992).
14. L. GOURNAY, J. J. RISLER Construction of roadmaps of semi-algebraic sets. Technical Report, DMI, Ecole Normale Superieure, Paris, France (1992).
15. J. HEINTZ, M.-F. ROY, P. SOLERNÒ Single exponential path finding in semi-algebraic sets II: The general case. Algebraic geometry and its applications. C. L. Bajaj editor, Springer Verlag (1993) 467-481.
16. J. HEINTZ, M.-F. ROY, P. SOLERNÒ Description of the Connected Components of a Semi-algebraic Set in Single Exponential Time, Discrete and Computational Geometry 11:121-140, (1994).
17. J. HEINTZ, T. RECIO, M.-F. ROY Algorithms in Real Algebraic Geometry and Applications to Computational Geometry Discrete and Computational Geometry: Selected Papers from the DIMACS Special Year, Ed. J. E. Goodman, R. Pollack and W. Steiger, AMS and ACM, 6:137-164, (1991).
18. J. MRLNOR Morse Theory, Annals of Mathematical Studies, Princeton University Press.
19. J. MLLNOR On the Betti numbers of real varieties, Proc. AMS 15, 275-280, (1964).
20. O. A. OLEINIK, I. B. PETROVSKII On the topology of real algebraic surfaces, Izv. Akad. Nauk SSSR 13, 389-402, (1949).
21. J. L. MONTANA, J. E. MORÁIS, L. M. PARDO Lower Bounds for Arithmetic Networks II: Sum of Betti Numbers, Applicable Algebra in Engineering, Communication and Computing, (1995).
22. R. POLLACK, M.-F. ROY On the number of cells defined by a set of polynomials, C. R. Acad. Sci. Paris, 316:573-577, (1993).
23. P. PEDERSEN, M.-F. ROY, A. SZPIRGLAS Counting real zeroes in the multivariate case. Computational algebraic geometry, Eyssette et Galligo ed. Progress in Mathematics 109, 203-224, Birkhauser (1993).
24. J. SCHWARTZ, M. SHARIR On the 'piano movers' problem II. General techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics 4, 298-351.
25. R. THOM Sur l'homologie des varietes algebriques reelles, Differential and Combinatorial Topology, Ed. S. S. Cairns, Princeton Univ. Press, 255-265, (1965).
26. A. C. YAO Decision Tree Complexity and Betti Numbers, Proceedings of the 26th STOC 615-624, (1994).