Nicolai N. Vorobjov Jr.

Publication Activity (10 Years)

Years Active: 1988-2021
Publications (10 Years): 7

Top Topics

Tropical Cyclone

Directional Relations

Topological Features

Top Venues

Discret. Comput. Geom.

Found. Comput. Math.

Comput. Complex.

Publications

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) (2021)
Dima Grigoriev, Nicolai N. Vorobjov Jr.
Orthogonal Tropical Linear Prevarieties. CASC (2018)
Andrei Gabrielov, Nicolai N. Vorobjov Jr.
On Topological Lower Bounds for Algebraic Computation Trees. Found. Comput. Math. 17 (1) (2017)
Andrei Gabrielov, Nicolai N. Vorobjov Jr.
Topological lower bounds for arithmetic networks. Comput. Complex. 26 (3) (2017)
Nicolai N. Vorobjov Jr., Andrei Gabrielov
On topological lower bounds for algebraic computation trees. CoRR (2015)
Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports 5 (6) (2015)
Andrei Gabrielov, Nicolai N. Vorobjov Jr.
Topological lower bounds for arithmetic networks. CoRR (2015)
Saugata Basu, Andrei Gabrielov, Nicolai N. Vorobjov Jr.
A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps. Discret. Comput. Geom. 50 (4) (2013)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. Ershov Memorial Conference (2011)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Computing combinatorial types of trajectories in Pfaffian Dynamics. J. Log. Algebraic Methods Program. 79 (1) (2010)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput. Syst. 43 (3-4) (2008)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Satisfiability of Viability Constraints for Pfaffian Dynamics. Ershov Memorial Conference (2006)
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)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. CiE (2006)
Andrei Gabrielov, Nicolai N. Vorobjov Jr.
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. Discret. Comput. Geom. 33 (3) (2005)
Margarita V. Korovina, Nicolai N. Vorobjov Jr.
Pfaffian Hybrid Systems. CSL (2004)
Nicolai N. Vorobjov Jr.
Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture). CSL (2003)
Nicolai N. Vorobjov Jr.
Effective Quantifier Elimination over Real Closed Fields (Tutorial). CSL (2003)
Dima Grigoriev, Nicolai N. Vorobjov Jr.
Complexity of Null-and Positivstellensatz proofs. Ann. Pure Appl. Log. 113 (1-3) (2001)
Savvas Pericleous, Nicolai N. Vorobjov Jr.
New complexity bounds for cylindrical decompositions of sub-pfaffian sets. ISSAC (2001)
Dima Grigoriev, Nicolai N. Vorobjov Jr.
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. ISSAC (2000)
Nicolai N. Vorobjov Jr.
Complexity of Computing the Local Dimension of a Semialgebraic Set. J. Symb. Comput. 27 (6) (1999)
Nicolai N. Vorobjov Jr.
Computing Local Dimension of a Semialgebraic Set. STOC (1998)
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) (1997)
Marie-Françoise Roy, Nicolai N. Vorobjov Jr.
Computing the Complexification of a Semi-Algebraic Set. ISSAC (1996)
Dima Grigoriev, Nicolai N. Vorobjov Jr.
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. Theor. Comput. Sci. 157 (2) (1996)
Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. FOCS (1995)
André Galligo, Nicolai N. Vorobjov Jr.
Complexity of Finding Irreducible Components of a Semialgebraic Set. J. Complex. 11 (1) (1995)
Andrei Gabrielov, Nicolai N. Vorobjov Jr.
Complexity of Stratifications of Semi-Pfaffian Sets. Discret. Comput. Geom. 14 (1) (1995)
Marie-Françoise Roy, Nicolai N. Vorobjov Jr.
Finding Irreducible Components of Some Real Transcendental Varieties. Comput. Complex. 4 (1994)
Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
Lower bounds on testing membership to a polyhedron by algebraic decision trees. STOC (1994)
Dima Grigoriev, Nicolai N. Vorobjov Jr.
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates FOCS (1994)
D. Yu. Grigoryev, Nicolai N. Vorobjov Jr.
Counting Connected Components of a Semialgebraic Set in Subexponential Time. Comput. Complex. 2 (1992)
Nicolai N. Vorobjov Jr.
The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities. J. Symb. Comput. 13 (2) (1992)
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 (1991)
Dima Grigoriev, Nicolai N. Vorobjov Jr.
Solving Systems of Polynomial Inequalities in Subexponential Time. J. Symb. Comput. 5 (1/2) (1988)