default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolai N. Vorobjov Jr.
Person information
- affiliation: University of Bath, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j18]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity of deciding whether a tropical linear prevariety is a tropical variety. Appl. Algebra Eng. Commun. Comput. 32(2): 157-174 (2021)
2010 – 2019
- 2018
- [c14]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Orthogonal Tropical Linear Prevarieties. CASC 2018: 187-196 - 2017
- [j17]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Topological lower bounds for arithmetic networks. Comput. Complex. 26(3): 687-715 (2017) - [j16]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
On Topological Lower Bounds for Algebraic Computation Trees. Found. Comput. Math. 17(1): 61-72 (2017) - 2015
- [i4]Nicolai N. Vorobjov Jr., Andrei Gabrielov:
On topological lower bounds for algebraic computation trees. CoRR abs/1502.04341 (2015) - [i3]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Topological lower bounds for arithmetic networks. CoRR abs/1510.03387 (2015) - [i2]Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports 5(6): 28-47 (2015) - 2013
- [j15]Saugata Basu, Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps. Discret. Comput. Geom. 50(4): 857-864 (2013) - 2011
- [c13]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. Ershov Memorial Conference 2011: 251-261 - 2010
- [j14]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Computing combinatorial types of trajectories in Pfaffian Dynamics. J. Log. Algebraic Methods Program. 79(1): 32-37 (2010)
2000 – 2009
- 2008
- [j13]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput. Syst. 43(3-4): 498-515 (2008) - 2006
- [c12]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. CiE 2006: 267-276 - [c11]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Satisfiability of Viability Constraints for Pfaffian Dynamics. Ershov Memorial Conference 2006: 260-269 - [i1]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [j12]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. Discret. Comput. Geom. 33(3): 395-401 (2005) - 2004
- [c10]Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Pfaffian Hybrid Systems. CSL 2004: 430-441 - 2003
- [c9]Nicolai N. Vorobjov Jr.:
Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture). CSL 2003: 544 - [c8]Nicolai N. Vorobjov Jr.:
Effective Quantifier Elimination over Real Closed Fields (Tutorial). CSL 2003: 545 - 2001
- [j11]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity of Null-and Positivstellensatz proofs. Ann. Pure Appl. Log. 113(1-3): 153-160 (2001) - [c7]Savvas Pericleous, Nicolai N. Vorobjov Jr.:
New complexity bounds for cylindrical decompositions of sub-pfaffian sets. ISSAC 2001: 268-275 - 2000
- [c6]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. ISSAC 2000: 137-146
1990 – 1999
- 1999
- [j10]Nicolai N. Vorobjov Jr.:
Complexity of Computing the Local Dimension of a Semialgebraic Set. J. Symb. Comput. 27(6): 565-579 (1999) - 1998
- [c5]Nicolai N. Vorobjov Jr.:
Computing Local Dimension of a Semialgebraic Set. STOC 1998: 483-487 - 1997
- [j9]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. 17(2): 191-215 (1997) - 1996
- [j8]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. Theor. Comput. Sci. 157(2): 185-214 (1996) - [c4]Marie-Françoise Roy, Nicolai N. Vorobjov Jr.:
Computing the Complexification of a Semi-Algebraic Set. ISSAC 1996: 26-34 - 1995
- [j7]Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
Complexity of Stratifications of Semi-Pfaffian Sets. Discret. Comput. Geom. 14(1): 71-91 (1995) - [j6]André Galligo, Nicolai N. Vorobjov Jr.:
Complexity of Finding Irreducible Components of a Semialgebraic Set. J. Complex. 11(1): 174-193 (1995) - [c3]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. FOCS 1995: 258-265 - 1994
- [b1]Nicolai N. Vorobjov Jr.:
Foundations of game theory - noncooperative games. Birkhäuser 1994, ISBN 978-3-7643-2378-3, pp. I-VI, 1-496 - [j5]Marie-Françoise Roy, Nicolai N. Vorobjov Jr.:
Finding Irreducible Components of Some Real Transcendental Varieties. Comput. Complex. 4: 107-132 (1994) - [c2]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. FOCS 1994: 548-552 - [c1]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower bounds on testing membership to a polyhedron by algebraic decision trees. STOC 1994: 635-644 - 1992
- [j4]D. Yu. Grigoryev, Nicolai N. Vorobjov Jr.:
Counting Connected Components of a Semialgebraic Set in Subexponential Time. Comput. Complex. 2: 133-186 (1992) - [j3]Nicolai N. Vorobjov Jr.:
The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities. J. Symb. Comput. 13(2): 139-174 (1992) - 1991
- [j2]John F. Canny, D. Yu. Grigor'ev, Nicolai N. Vorobjov Jr.:
Finding Connected Components of a Semialgebraic Set in Subexponential Time. Appl. Algebra Eng. Commun. Comput. 2: 217-238 (1991)
1980 – 1989
- 1988
- [j1]Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Solving Systems of Polynomial Inequalities in Subexponential Time. J. Symb. Comput. 5(1/2): 37-64 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
