Nicolai N. Vorobjov Jr.

37 papers A* 4B 7C 1Journal 21Unranked 3

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Complexity of deciding whether a tropical linear prevariety is a tropical variety. Appl. Algebra Eng. Commun. Comput. Dima Grigoriev, Nicolai N. Vorobjov Jr.
2018	B	`conf`	Orthogonal Tropical Linear Prevarieties. CASC Dima Grigoriev, Nicolai N. Vorobjov Jr.
2017	J	`jnl`	On Topological Lower Bounds for Algebraic Computation Trees. Found. Comput. Math. Andrei Gabrielov, Nicolai N. Vorobjov Jr.
2017	J	`jnl`	Topological lower bounds for arithmetic networks. Comput. Complex. Andrei Gabrielov, Nicolai N. Vorobjov Jr.
2015	J	`jnl`	Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242). Dagstuhl Reports Peter Bürgisser, Felipe Cucker, Marek Karpinski, Nicolai N. Vorobjov Jr.
2015	J	`jnl`	On topological lower bounds for algebraic computation trees. CoRR Nicolai N. Vorobjov Jr., Andrei Gabrielov
2015	J	`jnl`	Topological lower bounds for arithmetic networks. CoRR Andrei Gabrielov, Nicolai N. Vorobjov Jr.
2013	J	`jnl`	A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps. Discret. Comput. Geom. Saugata Basu, Andrei Gabrielov, Nicolai N. Vorobjov Jr.
2011	—	`conf`	Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. Ershov Memorial Conference Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2010	J	`jnl`	Computing combinatorial types of trajectories in Pfaffian Dynamics. J. Log. Algebraic Methods Program. Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2008	J	`jnl`	Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput. Syst. Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2006	—	`conf`	Satisfiability of Viability Constraints for Pfaffian Dynamics. Ershov Memorial Conference Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2006	—	`conf`	Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Reliable Implementation of Real Number Algorithms Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2006	C	`conf`	Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. CiE Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2005	J	`jnl`	Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. Discret. Comput. Geom. Andrei Gabrielov, Nicolai N. Vorobjov Jr.
2004	B	`conf`	Pfaffian Hybrid Systems. CSL Margarita V. Korovina, Nicolai N. Vorobjov Jr.
2003	B	`conf`	Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture). CSL Nicolai N. Vorobjov Jr.
2003	B	`conf`	Effective Quantifier Elimination over Real Closed Fields (Tutorial). CSL Nicolai N. Vorobjov Jr.
2001	J	`jnl`	Complexity of Null-and Positivstellensatz proofs. Ann. Pure Appl. Log. Dima Grigoriev, Nicolai N. Vorobjov Jr.
2001	B	`conf`	New complexity bounds for cylindrical decompositions of sub-pfaffian sets. ISSAC Savvas Pericleous, Nicolai N. Vorobjov Jr.
2000	B	`conf`	Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. ISSAC Dima Grigoriev, Nicolai N. Vorobjov Jr.
1999	J	`jnl`	Complexity of Computing the Local Dimension of a Semialgebraic Set. J. Symb. Comput. Nicolai N. Vorobjov Jr.
1998	A*	`conf`	Computing Local Dimension of a Semialgebraic Set. STOC Nicolai N. Vorobjov Jr.
1997	J	`jnl`	Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
1996	J	`jnl`	Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. Theor. Comput. Sci. Dima Grigoriev, Nicolai N. Vorobjov Jr.
1996	B	`conf`	Computing the Complexification of a Semi-Algebraic Set. ISSAC Marie-Françoise Roy, Nicolai N. Vorobjov Jr.
1995	J	`jnl`	Complexity of Finding Irreducible Components of a Semialgebraic Set. J. Complex. André Galligo, Nicolai N. Vorobjov Jr.
1995	J	`jnl`	Complexity of Stratifications of Semi-Pfaffian Sets. Discret. Comput. Geom. Andrei Gabrielov, Nicolai N. Vorobjov Jr.
1995	A*	`conf`	Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. FOCS Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
1994	A*	`conf`	Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates FOCS Dima Grigoriev, Nicolai N. Vorobjov Jr.
1994	J	`jnl`	Finding Irreducible Components of Some Real Transcendental Varieties. Comput. Complex. Marie-Françoise Roy, Nicolai N. Vorobjov Jr.
1994	—	`book`	Foundations of game theory - noncooperative games. Nicolai N. Vorobjov Jr.
1994	A*	`conf`	Lower bounds on testing membership to a polyhedron by algebraic decision trees. STOC Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.
1992	J	`jnl`	Counting Connected Components of a Semialgebraic Set in Subexponential Time. Comput. Complex. D. Yu. Grigoryev, Nicolai N. Vorobjov Jr.
1992	J	`jnl`	The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities. J. Symb. Comput. Nicolai N. Vorobjov Jr.
1991	J	`jnl`	Finding Connected Components of a Semialgebraic Set in Subexponential Time. Appl. Algebra Eng. Commun. Comput. John F. Canny, D. Yu. Grigor'ev, Nicolai N. Vorobjov Jr.
1988	J	`jnl`	Solving Systems of Polynomial Inequalities in Subexponential Time. J. Symb. Comput. Dima Grigoriev, Nicolai N. Vorobjov Jr.