On the complexity of counting components of algebraic varieties

  title={On the complexity of counting components of algebraic varieties},
  author={Peter B{\"u}rgisser and Peter Scheiblechner},
  journal={J. Symb. Comput.},
We give a uniform method for the two problems of counting the connected and irreducible components of complex algebraic varieties. Our algorithms are purely algebraic, i.e., they use only the field structure of C. They work in parallel polynomial time, i.e., they can be implemented by algebraic circuits of polynomial depth. The design of our algorithms relies on the concept of algebraic differential forms. A further important building block is an algorithm of Szántó computing a variant of… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…