Searching for authors named Nicolai Vorobjov – sorted by Relevance.
13 documents found, showing 1 through 10.
Next 10 →
-
APPROXIMATION OF DEFINABLE SETS BY COMPACT FAMILIES, AND UPPER BOUNDS ON HOMOTOPY AND HOMOLOGY
- … ANDREI GABRIELOV AND NICOLAI VOROBJOV Abstract. We prove new upper bounds on homotopy and homology groups…
- Add To MetaCart
-
Complexity of computations with Pfaffian and Noetherian functions
- … of Mathematics Purdue University West Lafayette, IN 47907, USA Nicolai VOROBJOV Department of Computer Science…
- Cited by 11 (5 self) – Add To MetaCart
-
Complexity of cylindrical decompositions of sub-Pfaffian sets
- … University in August–September, 1999. 1 2 ANDREI GABRIELOV AND NICOLAI VOROBJOV f1,... ,fr in G satisfying…
- Cited by 12 (7 self) – Add To MetaCart
-
Pfaffian hybrid systems
- …Pfaffian hybrid systems Margarita Korovina 1 and Nicolai Vorobjov 2 1 A.P.Ershov Institute…
- Cited by 8 (2 self) – Add To MetaCart
-
On the number of homotopy types of fibres of a definable map
- … SAUGATA BASU AND NICOLAI VOROBJOV Abstract. In this paper we prove a single exponential upper bound…
- Cited by 8 (2 self) – Add To MetaCart
-
Vorobjov Betti numbers of semi-algebraic sets defined by quantifier-free formulae, Discrete and Computational Geometry
- … GABRIELOV, NICOLAI VOROBJOV Since sums of Betti numbers of sets X and X ∩{x2 1 + ···+ x2n < Ω} coincide…
- Cited by 11 (4 self) – Add To MetaCart
-
Complexity of Null- and Positivstellensatz Proofs
- …Complexity of Null- and Positivstellensatz Proofs Dima Grigoriev Nicolai Vorobjov y Dedicated…
- Cited by 4 (2 self) – Add To MetaCart
-
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates (Extended Abstract)
- … (Extended abstract) Dima Grigoriev Nicolai Vorobjov Departments of Computer Science and Mathematics Penn…
- Cited by 8 (3 self) – Add To MetaCart
-
New complexity bounds for cylindrical decompositions of sub-Pfaffian sets
- …New complexity bounds for cylindrical decompositions of sub-Pfaan sets Savvas Pericleous Nicolai…
- Cited by 4 (2 self) – Add To MetaCart
-
Bounds on Numbers of Vectors of Multiplicities for Polynomials which are Easy to Compute
- … Grigoriev IRMAR, Universit de Rennes, Campus de Beaulieu, 35042 Rennes, cedex France Nicolai Vorobjov…
- Cited by 4 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
