Complexity of Computations with Pfaffian and Noetherian Functions

@inproceedings{Gabrielov2004ComplexityOC,
  title={Complexity of Computations with Pfaffian and Noetherian Functions},
  author={Andrei Gabrielov and Nicolai Vorobjov},
  year={2004}
}
This paper is a survey of the upper bounds on the complexity of basic algebraic and geometric operations with Pfaffian and Noetherian functions, and with sets definable by these functions. Among other results, we consider bounds on Betti numbers of sub-Pfaffian sets, multiplicities of Pfaffian intersections, effective Lojasiewicz inequality for Pfaffian functions, computing the frontier and closure of restricted semi-Pfaffian sets, constructing smooth stratifications and cylindrical cell… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
29 Citations
51 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 51 references

On the Betti numbers of real varieties

  • J. Milnor
  • Proc. Amer. Math. Soc. 15
  • 1964
Highly Influential
5 Excerpts

Fewnomials

  • A. Khovanskii
  • Transl. Math. Monogr. 88, Amer. Math. Soc…
  • 1991
Highly Influential
4 Excerpts

Tráng, Some remarks on relative monodromy, in: Real and Complex Singularities

  • Lê Dũng
  • Oslo 1976 (P. Holm, ed.), Sijthoff & Noordhoff,
  • 1977
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…