Computing the euler-poincaré characteristics of sign conditions

Computational Complexity

Volumn 14, Issue 1, 2005, Pages 53-71

  Basu, Saugata ^a   Pollack, Richard ^b   Roy, Marie Francçoise ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Euler Poincar characteristic; Semi algebraic sets

Indexed keywords

EID: 18244377137     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0190-1     Document Type: Article

References (17)

1. S. BASU (1999). On bounding the Betti numbers and computing the Euler characteristics of semi-algebraic sets. Discrete Comput. Geom. 22, 1-18.
2. S. BASU, R. POLLACK & M.-F. ROY (1997). On computing a set of points meeting every cell defined by a family of polynomials on a variety. J. Complexity 13, 28-37.
3. S. BASU, R. POLLACK & M.-F. ROY (2000). Computing roadmaps of semi-algebraic sets on a variety. J. Amer. Math. Soc. 3, 55-82.
4. S. BASU, R. POLLACK & M.-F. ROY (2003). Algorithms in Real Algebraic Geometry, Springer.
5. S. BASU, R. POLLACK & M.-F. ROY (2005). On the Betti numbers of sign conditions. Proc. Amer. Math. Soc. (to appear).
6. M. BEN-OR, D. KOZEN & J. REIF (1986). The complexity of elementary algebra and geometry. J. Comput. System Sci. 32, 251-264.
7. J. BOCHNAK, M. COSTE & M.-F. ROY (1987). Géométrie algébrique réelle. Springer; English transi.: Real Algebraic Geometry Springer, 1998.
8. A. BOREL & J. C. MOORE (1960). Homology theory for locally compact spaces. Michigan Math. J. 7, 137-159.
9. J. CANNY (1993). Computing roadmaps of general semi-algebraic sets. Comput. J. 36, 504-514.
10. L. GOURNAY & J. J. RISLER (1993). Construction of roadmaps of semi-algebraic sets. Appl. Algebra Engrg. Comm. Comput. 4, 239-252.
11. D. GRIGOR'EV & N. VOROBJOV (1992). Counting connected components of a semi-algebraic set in subexponential time. Comput. Complexity 2, 133-186.
12. D. HALPERIN (1997). Arrangements. In Handbook of Discrete and Computational Geometry, J. O'Rourke and J. E. Goodman (eds.), CRC Press, 389-412.
13. R. M. HARDT (1980). Semi-algebraic local triviality in semi-algebraic mappings. Amer. J. Math. 102, 291-302.
14. J. HEINTZ, M.-F. ROY & P. SOLERNÓ (1994). Description of the connected components of a semialgebraic set in single exponential time. Discrete Comput. Geom. 11, 121-140.
15. P. PEDERSEN, M.-F. ROY & A. SZPIRGLAS (1993). Counting real zeros in the multivariate case. In Computational Algebraic Geometry, F. Eyssette and A. Galligo (eds.), Progr. Math. 109, Birkhäuser, 203-224.
16. J. RENEGAR (1992). On the computational complexity and geometry of the first-order theory of the reals. J. Symbolic Comput. 13, 255-352.
17. M.-F. ROY & A. SZPIRGLAS (1990). Complexity of computation on real algebraic numbers. J. Symbolic Comput. 10, 39-51.