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

Peter Scheiblechner. On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety. J. Complexity, 23(3):359-379, 2007. [doi]

@article{Scheiblechner07,
  title = {On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety},
  author = {Peter Scheiblechner},
  year = {2007},
  doi = {10.1016/j.jco.2007.03.008},
  url = {http://dx.doi.org/10.1016/j.jco.2007.03.008},
  tags = { algebra},
  researchr = {https://researchr.org/publication/Scheiblechner07},
  cites = {0},
  citedby = {0},
  journal = {J. Complexity},
  volume = {23},
  number = {3},
  pages = {359-379},
}