Nicolai Vorobjov
Nicolai Vorobjov
ยืนยันอีเมลแล้วที่ cs.bath.ac.uk
ชื่อ
อ้างโดย
อ้างโดย
ปี
Solving systems of polynomial inequalities in subexponential time
DY Grigor'ev, NN Vorobjov Jr
Journal of symbolic computation 5 (1-2), 37-64, 1988
4071988
Counting connected components of a semialgebraic set in subexponential time
DY Grigor'ev, NN Vorobjov
Computational Complexity 2 (2), 133-186, 1992
861992
Complexity of computations with Pfaffian and Noetherian functions
A Gabrielov, N Vorobjov
Normal forms, bifurcations and finiteness problems in differential equations …, 2004
852004
Complexity of Null-and Positivstellensatz proofs
D Grigoriev, N Vorobjov
Annals of Pure and Applied Logic 113 (1-3), 153-160, 2001
832001
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
552004
Complexity of stratification of semi-Pfaffian sets
A Gabrielov, N Vorobjov
Discrete & Computational Geometry 14 (1), 71-91, 1995
441995
Betti numbers of semialgebraic sets defined by quantifier-free formulae
A Gabrielov, N Vorobjov
Discrete & Computational Geometry 33 (3), 395-401, 2005
432005
Finding connected components of a semialgebraic set in subexponential time
J Canny, DY Grigor'ev, NN Vorobjov
Applicable Algebra in Engineering, Communication and Computing 2 (4), 217-238, 1992
421992
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
342009
Complexity of cylindrical decompositions of sub-Pfaffian sets
A Gabrielov, N Vorobjov
Journal of Pure and Applied Algebra 164 (1-2), 179-197, 2001
332001
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
302000
Pfaffian hybrid systems
M Korovina, N Vorobjov
International Workshop on Computer Science Logic, 430-441, 2004
282004
Complexity of finding irreducible components of a semialgebraic set
A Galligo, N Vorobjov
Journal of Complexity 11 (1), 174-193, 1995
251995
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
232007
Computing the Complexification of a Semi-algebraic Set
MF Roy, N Vorobjov
Proceedings of the 1996 international symposium on Symbolic and algebraic …, 1996
221996
Complexity lower bounds for computation trees with elementary transcendental function gates
D Grigoriev, N Vorobjov
Theoretical computer science 157 (2), 185-214, 1996
211996
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 complexity of deciding consistency of systems of polynomials in exponent inequalities
NN Vorobjov Jr
Journal of symbolic computation 13 (2), 139-173, 1992
181992
Semi-monotone sets
S Basu, A Gabrielov, N Vorobjov
arXiv preprint arXiv:1004.5047, 2010
172010
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
171995
ระบบไม่สามารถดำเนินการได้ในขณะนี้ โปรดลองใหม่อีกครั้งในภายหลัง
บทความ 1–20