Nicolai N. Vorobjov Jr.

Appl. Algebra Eng. Commun. Comput., 2021

2018

Orthogonal Tropical Linear Prevarieties.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017

On Topological Lower Bounds for Algebraic Computation Trees.

[BibT_eX]

[DOI]

Found. Comput. Math., 2017

Topological lower bounds for arithmetic networks.

[BibT_eX]

[DOI]

Comput. Complex., 2017

2015

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

[BibT_eX]

[DOI]

Peter Bürgisser

Felipe Cucker

Dagstuhl Reports, 2015

2013

A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps.

[BibT_eX]

[DOI]

Saugata Basu

Discret. Comput. Geom., 2013

2011

Reachability in One-Dimensional Controlled Polynomial Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2011

2010

Computing combinatorial types of trajectories in Pfaffian Dynamics.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

2008

Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

2006

Satisfiability of Viability Constraints for Pfaffian Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2006

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

2004

Pfaffian Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

Effective Quantifier Elimination over Real Closed Fields (Tutorial).

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture).

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2001

Complexity of Null-and Positivstellensatz proofs.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2001

New complexity bounds for cylindrical decompositions of sub-pfaffian sets.

[BibT_eX]

[DOI]

Savvas Pericleous

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.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999

Complexity of Computing the Local Dimension of a Semialgebraic Set.

[BibT_eX]

[DOI]

J. Symb. Comput., 1999

1998

Computing Local Dimension of a Semialgebraic Set.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

1996

Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Computing the Complexification of a Semi-Algebraic Set.

[BibT_eX]

[DOI]

Marie-Françoise Roy

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Complexity of Finding Irreducible Components of a Semialgebraic Set.

[BibT_eX]

[DOI]

André Galligo

J. Complex., 1995

Complexity of Stratifications of Semi-Pfaffian Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Finding Irreducible Components of Some Real Transcendental Varieties.

[BibT_eX]

[DOI]

Marie-Françoise Roy

Comput. Complex., 1994

Lower bounds on testing membership to a polyhedron by algebraic decision trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Foundations of game theory - noncooperative games.

[BibT_eX]

Birkhäuser, ISBN: 978-3-7643-2378-3, 1994

1992

The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities.

[BibT_eX]

[DOI]

J. Symb. Comput., 1992

Counting Connected Components of a Semialgebraic Set in Subexponential Time.

[BibT_eX]

[DOI]

D. Yu. Grigoryev

Comput. Complex., 1992

1991

Finding Connected Components of a Semialgebraic Set in Subexponential Time.

[BibT_eX]

[DOI]

John F. Canny

D. Yu. Grigor'ev

Appl. Algebra Eng. Commun. Comput., 1991

1988

Solving Systems of Polynomial Inequalities in Subexponential Time.

[BibT_eX]

[DOI]