Complexity of computations with Pfaffian and Noetherian functions

By Nicolai N. Vorobjov, Andrei Gabrielov. 2004

100 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/64bff4c088cbf8baf032309c2d2bc7258cacc727

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Nicolai N. Vorobjov
2. Andrei Gabrielov

In Geometry and Topology

1. Nicolai N. Vorobjov
2. Andrei Gabrielov

Citations in the corpus

• Approximation of definable sets by compact families, and upper bounds on homotopy and homology (2007, methodology): “, the projection of a semi-Pfaffian set may not be semi-Pfaffian, see [8]), it is not possible to apply in the Pfaffian case the same method that we used to obtain the bound (6.”