Highly Influenced

12 Excerpts

@article{Brgisser2009OnTC, title={On the complexity of counting components of algebraic varieties}, author={Peter B{\"u}rgisser and Peter Scheiblechner}, journal={J. Symb. Comput.}, year={2009}, volume={44}, pages={1114-1136} }

- Published in J. Symb. Comput. 2009
DOI:10.1016/j.jsc.2008.02.009

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

SHOWING 1-9 OF 9 CITATIONS

Highly Influenced

12 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

3 Excerpts

1 Excerpt

1 Excerpt

1 Excerpt

SHOWING 1-10 OF 48 REFERENCES

Highly Influential

4 Excerpts

Highly Influential

12 Excerpts

Highly Influential

5 Excerpts

Highly Influential

10 Excerpts

Highly Influential

6 Excerpts

Highly Influential

6 Excerpts

Highly Influential

6 Excerpts

Highly Influential

4 Excerpts

Highly Influential

3 Excerpts

Highly Influential

4 Excerpts

Loading similar papers…