Follow
Nicolai Vorobjov
Nicolai Vorobjov
Verified email at cs.bath.ac.uk
Title
Cited by
Cited by
Year
Solving systems of polynomial inequalities in subexponential time
DY Grigor'ev, NN Vorobjov Jr
Journal of symbolic computation 5 (1-2), 37-64, 1988
4721988
Complexity of Null-and Positivstellensatz proofs
D Grigoriev, N Vorobjov
Annals of Pure and Applied Logic 113 (1-3), 153-160, 2001
1072001
Complexity of computations with Pfaffian and Noetherian functions
A Gabrielov, N Vorobjov
Normal forms, bifurcations and finiteness problems in differential equations …, 2004
982004
Counting connected components of a semialgebraic set in subexponential time
DY Grigor'ev, NN Vorobjov
Computational Complexity 2, 133-186, 1992
981992
Betti numbers of semialgebraic and sub-Pfaffian sets
A Gabrielov, N Vorobjov, T Zell
Journal of the London Mathematical Society 69 (1), 27-43, 2004
602004
Complexity of stratification of semi-Pfaffian sets
A Gabrielov, N Vorobjov
Discrete & computational geometry 14 (1), 71-91, 1995
501995
Betti numbers of semialgebraic sets defined by quantifier-free formulae
A Gabrielov, N Vorobjov
Discrete & Computational Geometry 33, 395-401, 2005
482005
Finding connected components of a semialgebraic set in subexponential time
J Canny, DY Grigor'ev, NN Vorobjov Jr
Applicable Algebra in Engineering, Communication and Computing 2 (4), 217-238, 1992
431992
Approximation of definable sets by compact families, and upper bounds on homotopy and homology
A Gabrielov, N Vorobjov
Journal of the London Mathematical Society 80 (1), 35-54, 2009
422009
Complexity of cylindrical decompositions of sub-Pfaffian sets
A Gabrielov, N Vorobjov
Journal of Pure and Applied Algebra 164 (1-2), 179-197, 2001
372001
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
D Grigoriev, N Vorobjov
Proceedings of the 2000 international symposium on Symbolic and algebraic …, 2000
312000
Complexity of finding irreducible components of a semialgebraic set
A Galligo, N VOROBJov
Journal of Complexity 11 (1), 174-193, 1995
301995
Pfaffian hybrid systems
M Korovina, N Vorobjov
Computer Science Logic: 18th International Workshop, CSL 2004, 13th Annual …, 2004
292004
On the number of homotopy types of fibres of a definable map
S Basu, N Vorobjov
Journal of the London Mathematical Society 76 (3), 757-776, 2007
282007
Complexity lower bounds for computation trees with elementary transcendental function gates
D Grigoriev, N Vorobjov
Theoretical computer science 157 (2), 185-214, 1996
241996
Improved lower bound on testing membership to a polyhedron by algebraic decision trees
D Grigoriev, M Karpinski, N Vorobjov
Proceedings of IEEE 36th Annual Foundations of Computer Science, 258-265, 1995
241995
Computing the complexification of a semi-algebraic set
MF Roy, N Vorobjov
Proceedings of the 1996 international symposium on Symbolic and algebraic …, 1996
211996
Semi-monotone sets.
S Basu, A Gabrielov, N Vorobjov
Journal of the European Mathematical Society (EMS Publishing) 15 (2), 2013
202013
Deciding consistency of systems of polynomial in exponent inequalities in subexponential time
NN Vorobjov Jr
Effective Methods in Algebraic Geometry, 491-500, 1991
201991
Upper and lower bounds on sizes of finite bisimulations of Pfaffian hybrid systems
M Korovina, N Vorobjov
Conference on Computability in Europe, 267-276, 2006
192006
The system can't perform the operation now. Try again later.
Articles 1–20