Nikolaj N. jun. Vorob'ev

From MaRDI portal
Person:1190746

Available identifiers

zbMath Open vorobev.nikolai-n-junMaRDI QIDQ1190746

List of research outcomes

PublicationDate of PublicationType
Effective Cylindrical Cell Decompositions for Restricted Sub-Pfaffian Sets2022-03-10Paper
Lecture notes on complexity of quantifier elimination over the reals2021-12-01Paper
Complexity of deciding whether a tropical linear prevariety is a tropical variety2021-06-11Paper
Upper bounds on Betti numbers of tropical prevarieties2018-11-08Paper
Orthogonal tropical linear prevarieties2018-10-23Paper
On irreducible components of real exponential hypersurfaces2018-02-22Paper
Topological lower bounds for arithmetic networks2017-10-18Paper
On topological lower bounds for algebraic computation trees2017-05-05Paper
New complexity bounds for cylindrical decompositions of sub-pfaffian sets2017-02-03Paper
Lower bounds on testing membership to a polyhedron by algebraic decision trees2016-09-01Paper
Triangulations of monotone families I: two-dimensional families2015-12-18Paper
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems2015-12-07Paper
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute2015-11-26Paper
A Helly-type theorem for semi-monotone sets and monotone maps2014-01-24Paper
Semi-monotone sets2013-03-07Paper
Monotone functions and maps2013-03-06Paper
Toric cubes are closed balls2012-02-24Paper
Satisfiability of Viability Constraints for Pfaffian Dynamics2010-02-02Paper
Computing combinatorial types of trajectories in Pfaffian dynamics2009-12-18Paper
Approximation of definable sets by compact families, and upper bounds on homotopy and homology2009-07-31Paper
Bounds on sizes of finite bisimulations of Pfaffian dynamical systems2009-05-08Paper
On the number of homotopy types of fibres of a definable map2008-01-16Paper
Computer Science Logic2007-06-21Paper
Computer Science Logic2007-06-21Paper
Logical Approaches to Computational Barriers2007-04-30Paper
https://portal.mardi4nfdi.de/entity/Q56927212005-09-28Paper
Computer Science Logic2005-08-22Paper
Betti numbers of semialgebraic sets defined by quantifier-free formulae2005-04-28Paper
BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS2004-06-14Paper
Complexity of cylindrical decompositions of sub-Pfaffian2002-10-10Paper
https://portal.mardi4nfdi.de/entity/Q45425672002-08-01Paper
The complexification and degree of a semi-algebraic set.2002-06-18Paper
Complexity of Null- and Positivstellensatz proofs2002-03-13Paper
Complexity of computing the local dimension of a semialgebraic set2000-07-18Paper
https://portal.mardi4nfdi.de/entity/Q42527102000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42273191999-04-22Paper
Complexity lower bounds for computation trees with elementary transcendental function gates1997-09-09Paper
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees1997-03-23Paper
Complexity of stratifications of semi-Pfaffian sets1995-08-01Paper
Complexity of finding irreducible components of a semialgebraic set1995-04-05Paper
Finding irreducible components of some real transcendental varieties1994-09-01Paper
Deciding consistency of systems of exponential-polynomial inequalities in subexponential time1993-09-15Paper
https://portal.mardi4nfdi.de/entity/Q40373691993-05-18Paper
Counting connected components of a semialgebraic set in subexponential time1993-04-01Paper
Finding connected components of a semialgebraic set in subexponential time1992-09-27Paper
Finding connected components of a semialgebraic set in subexponential time1992-09-27Paper
The complexity of deciding consistency of systems of polynomials in exponent inequalities1992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39733521992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39803331992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39711331992-06-25Paper
Solving systems of polynomial inequalities over a real closed field in subexponential time1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33640331991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34858041989-01-01Paper
Solving systems of polynomial inequalities in subexponential time1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47333141988-01-01Paper
Estimates of real roots of a system of algebraic equations1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37467981985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33365891984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39661841982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Nikolaj N. jun. Vorob'ev