Nicolai N. Vorobjov Jr.

Affiliations:
  • University of Bath, UK


According to our database1, Nicolai N. Vorobjov Jr. authored at least 34 papers between 1988 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Complexity of deciding whether a tropical linear prevariety is a tropical variety.
Appl. Algebra Eng. Commun. Comput., 2021

2018
Orthogonal Tropical Linear Prevarieties.
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017
On Topological Lower Bounds for Algebraic Computation Trees.
Found. Comput. Math., 2017

Topological lower bounds for arithmetic networks.
Comput. Complex., 2017

2015
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242).
Dagstuhl Reports, 2015

2013
A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps.
Discret. Comput. Geom., 2013

2011
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems.
Proceedings of the Perspectives of Systems Informatics, 2011

2010
Computing combinatorial types of trajectories in Pfaffian Dynamics.
J. Log. Algebraic Methods Program., 2010

2008
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.
Theory Comput. Syst., 2008

2006
Satisfiability of Viability Constraints for Pfaffian Dynamics.
Proceedings of the Perspectives of Systems Informatics, 2006

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae.
Discret. Comput. Geom., 2005

2004
Pfaffian Hybrid Systems.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Effective Quantifier Elimination over Real Closed Fields (Tutorial).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2001
Complexity of Null-and Positivstellensatz proofs.
Ann. Pure Appl. Log., 2001

New complexity bounds for cylindrical decompositions of sub-pfaffian sets.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999
Complexity of Computing the Local Dimension of a Semialgebraic Set.
J. Symb. Comput., 1999

1998
Computing Local Dimension of a Semialgebraic Set.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.
Discret. Comput. Geom., 1997

1996
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates.
Theor. Comput. Sci., 1996

Computing the Complexification of a Semi-Algebraic Set.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
Complexity of Finding Irreducible Components of a Semialgebraic Set.
J. Complex., 1995

Complexity of Stratifications of Semi-Pfaffian Sets.
Discret. Comput. Geom., 1995

Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Finding Irreducible Components of Some Real Transcendental Varieties.
Comput. Complex., 1994

Lower bounds on testing membership to a polyhedron by algebraic decision trees.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Foundations of game theory - noncooperative games.
Birkhäuser, ISBN: 978-3-7643-2378-3, 1994

1992
The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities.
J. Symb. Comput., 1992

Counting Connected Components of a Semialgebraic Set in Subexponential Time.
Comput. Complex., 1992

1991
Finding Connected Components of a Semialgebraic Set in Subexponential Time.
Appl. Algebra Eng. Commun. Comput., 1991

1988
Solving Systems of Polynomial Inequalities in Subexponential Time.
J. Symb. Comput., 1988


  Loading...