On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety

Journal of Complexity

Volumn 23, Issue 3, 2007, Pages 359-379

  Scheiblechner, Peter ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Betti numbers; Connected components; Lower bounds; PSPACE

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

COMPLEX ALGEBRAIC VARIETY; COUNTING COMPLEXITY;

NUMBER THEORY;

EID: 34249680239     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2007.03.008     Document Type: Article

References (15)

1. Basu S. Computing the first few Betti numbers of semi-algebraic sets in single exponential time. J. Symbolic Comput. 41 10 (2006) 1125-1154
2. J. Bochnak, M. Coste, M.F. Roy, Real Algebraic Geometry, Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, vol. 36, Springer, 1998.
3. G.E. Bredon, Topology and geometry, Graduate Texts in Mathematics, vol. 139, Springer, New York, 1997.
4. Bürgisser P., and Cucker F. Counting complexity classes for numeric computations I: semilinear sets. SIAM J. Comput. 33 (2003) 227-260
5. P. Bürgisser, F. Cucker, Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré, in: J. Krajicek (Ed.), Complexity of Computations and Proofs, Quaderni di Matematica, vol. 13, Department of Mathematics, Seconda Università di Napoli, Caserta, Napoli, Italy, 2005, pp. 73-152.
6. Bürgisser P., and Cucker F. Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. J. Complexity 22 (2006) 147-191
7. Bürgisser P., Cucker F., and de Naurois P. The complexity of semilinear problems in succinct representation. Comput. Complexity 15 3 (2006) 197-235
8. J. Canny, Some algebraic and geometric computations in PSPACE, in: Proceedings of the 20th Annual ACM STOC, 1988, pp. 460-467.
9. E.M. Friedlander, B. Mazur, Filtrations on the homology of algebraic varieties, Mem. Amer. Math. Soc. 110 (529) (1994) ix+110.
10. J. Harris, Algebraic geometry, Graduate Texts in Mathematics, vol. 133, Springer, New York, 1992.
11. Hatcher A. Algebraic Topology (2002), Cambridge University Press, Cambridge
12. Ladner R.E. Polynomial space counting problems. SIAM J. Comput. 18 6 (1989) 1087-1097
13. J.H. Reif, Complexity of the mover's problem and generalizations, in: Proceedings of 20th FOCS, 1979, pp. 421-427.
14. Reif J.H. Complexity of the generalized mover's problem. In: Schwartz J.T., Sharir M., and Hopcroft J. (Eds). Planning, Geometry and Complexity of Robot Motion (1987), Ablex Publishing Corporation 267-281
15. Spanier E.H. Algebraic Topology, McGraw-Hill Series in Higher Mathematics (1966), McGraw-Hill Book Company, New York