The complexity to compute the Euler characteristic of complex varieties;La complexité du calcul de la caractéristique d'Euler des variétés complexes

Comptes Rendus Mathematique

Volumn 339, Issue 5, 2004, Pages 371-376

  Bürgisser, Peter ^a   Cucker, Felipe ^b   Lotz, Martin ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4444381933     PISSN: 1631073X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.crma.2004.06.008     Document Type: Article

References (9)

1. P. Aluffi Computing characteristic classes of projective schemes J. Symbolic Comput. 35 1 2003 3-19
2. L. Blum F. Cucker M. Shub S. Smale Complexity and Real Computation 1998 Springer-Verlag New York
3. P. Bürgisser F. Cucker Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets in: Proc. 36th Ann. ACM STOC 2004 Full version in http://www.arxiv.org/abs/cs/cs.CC/0312007
4. P. Bürgisser F. Cucker M. Lotz Counting complexity classes for numeric computations III: Complex projective sets Full version in http://math-www.upb.de/agpb 2004 in preparation
5. A. Dimca Singularities and Topology of Hypersurfaces Universitext 1992 Springer-Verlag
6. J. Harris Algebraic Geometry Graduate Texts in Math. vol. 133 1995 Springer-Verlag New York
7. P. Koiran Randomized and deterministic algorithms for the dimension of algebraic varieties in: Proc. 38th FOCS 1997 36-45
8. J. Renegar On the computational complexity and geometry of the first-order theory of the reals. Part I, II, III J. Symbolic Comput. 13 3 1992 255-352
9. L.G. Valiant The complexity of computing the permanent Theoret. Comput. Sci. 8 1979 189-201