The following pages link to Nicolai Vorobjov (Q1190746):
Displaying 50 items.
- A Helly-type theorem for semi-monotone sets and monotone maps (Q393726) (← links)
- On topological lower bounds for algebraic computation trees (Q525599) (← links)
- (Q677020) (redirect page) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
- (Q804240) (redirect page) (← links)
- (Q220799) (redirect page) (← links)
- (Q1077878) (redirect page) (← links)
- (Q220799) (redirect page) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Bounds on sizes of finite bisimulations of Pfaffian dynamical systems (Q1015374) (← links)
- Computing combinatorial types of trajectories in Pfaffian dynamics (Q1044670) (← links)
- Estimates of real roots of a system of algebraic equations (Q1077879) (← links)
- (Q1113938) (redirect page) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Finding irreducible components of some real transcendental varieties (Q1332661) (← links)
- Complexity of finding irreducible components of a semialgebraic set (Q1346599) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Upper bounds on Betti numbers of tropical prevarieties (Q1617464) (← links)
- On irreducible components of real exponential hypersurfaces (Q1701165) (← links)
- Betti numbers of semialgebraic sets defined by quantifier-free formulae (Q1773889) (← links)
- Orthogonal tropical linear prevarieties (Q1798321) (← links)
- Complexity of stratifications of semi-Pfaffian sets (Q1894719) (← links)
- Monotone functions and maps (Q1940343) (← links)
- Semi-monotone sets (Q1940824) (← links)
- Complexity of deciding whether a tropical linear prevariety is a tropical variety (Q2032307) (← links)
- Topological lower bounds for arithmetic networks (Q2410689) (← links)
- Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657) (← links)
- New complexity bounds for cylindrical decompositions of sub-pfaffian sets (Q2958944) (← links)
- (Q3336589) (← links)
- (Q3364033) (← links)
- Satisfiability of Viability Constraints for Pfaffian Dynamics (Q3401952) (← links)
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute (Q3454754) (← links)
- Reachability in One-Dimensional Controlled Polynomial Dynamical Systems (Q3457983) (← links)
- Triangulations of monotone families I: two-dimensional families (Q3458234) (← links)
- (Q3485804) (← links)
- (Q3746798) (← links)
- (Q3966184) (← links)
- (Q3971133) (← links)
- (Q3973352) (← links)
- (Q3980333) (← links)
- (Q4037369) (← links)
- (Q4227319) (← links)
- (Q4252710) (← links)
- BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS (Q4469249) (← links)
- (Q4542567) (← links)
- (Q4733314) (← links)
- Computer Science Logic (Q5292666) (← links)
- Computer Science Logic (Q5292667) (← links)
- Computer Science Logic (Q5311274) (← links)
