| Publication | Date of Publication | Type |
|---|
Partitioning theorems for sets of semi-Pfaffian sets, with applications
Forum of Mathematics, Sigma | 2026-01-21 | Paper |
On multiply local formations with a Stone lattice of subformations
Vestsi Natsyyanal'naĭ Akadèmii Navuk Belarusi. Seryya Fizika-Matèmatychnykh Navuk | 2025-01-17 | Paper |
On Boolean lattices of partially saturated formations
Vestsi Natsyyanal'naĭ Akadèmii Navuk Belarusi. Seryya Fizika-Matèmatychnykh Navuk | 2025-01-17 | Paper |
Modularity of the lattice of Baer n-multiply -local formations
Algebra and Logic | 2024-09-04 | Paper |
Effective cylindrical cell decompositions for restricted sub-Pfaffian sets
IMRN. International Mathematics Research Notices | 2022-03-10 | Paper |
| Lecture notes on complexity of quantifier elimination over the reals | 2021-12-01 | Paper |
Complexity of deciding whether a tropical linear prevariety is a tropical variety
Applicable Algebra in Engineering, Communication and Computing | 2021-06-11 | Paper |
Upper bounds on Betti numbers of tropical prevarieties
Arnold Mathematical Journal | 2018-11-08 | Paper |
| Orthogonal tropical linear prevarieties | 2018-10-23 | Paper |
On irreducible components of real exponential hypersurfaces
Arnold Mathematical Journal | 2018-02-22 | Paper |
On irreducible components of real exponential hypersurfaces
Arnold Mathematical Journal | 2018-02-22 | Paper |
Topological lower bounds for arithmetic networks
Computational Complexity | 2017-10-18 | Paper |
Topological lower bounds for arithmetic networks
Computational Complexity | 2017-10-18 | Paper |
On topological lower bounds for algebraic computation trees
Foundations of Computational Mathematics | 2017-05-05 | Paper |
New complexity bounds for cylindrical decompositions of sub-Pfaffian sets
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Lower bounds on testing membership to a polyhedron by algebraic decision trees
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Triangulations of monotone families. I: two-dimensional families
Proceedings of the London Mathematical Society | 2015-12-18 | Paper |
Triangulations of monotone families. I: two-dimensional families
Proceedings of the London Mathematical Society | 2015-12-18 | Paper |
Reachability in one-dimensional controlled polynomial dynamical systems
Perspectives of Systems Informatics | 2015-12-07 | Paper |
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 | 2015-11-26 | Paper |
A Helly-type theorem for semi-monotone sets and monotone maps
Discrete & Computational Geometry | 2014-01-24 | Paper |
Semi-monotone sets
Journal of the European Mathematical Society (JEMS) | 2013-03-07 | Paper |
Monotone functions and maps
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM | 2013-03-06 | Paper |
| Toric cubes are closed balls | 2012-02-24 | Paper |
Satisfiability of Viability Constraints for Pfaffian Dynamics
Perspectives of Systems Informatics | 2010-02-02 | Paper |
Computing combinatorial types of trajectories in Pfaffian dynamics
The Journal of Logic and Algebraic Programming | 2009-12-18 | Paper |
Approximation of definable sets by compact families, and upper bounds on homotopy and homology
Journal of the London Mathematical Society | 2009-07-31 | Paper |
Bounds on sizes of finite bisimulations of Pfaffian dynamical systems
Theory of Computing Systems | 2009-05-08 | Paper |
On the number of homotopy types of fibres of a definable map
Journal of the London Mathematical Society | 2008-01-16 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
| scientific article; zbMATH DE number 2209738 (Why is no real title available?) | 2005-09-28 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Betti numbers of semialgebraic sets defined by quantifier-free formulae
Discrete & Computational Geometry | 2005-04-28 | Paper |
BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
Journal of the London Mathematical Society | 2004-06-14 | Paper |
Complexity of cylindrical decompositions of sub-Pfaffian
Journal of Pure and Applied Algebra | 2002-10-10 | Paper |
| scientific article; zbMATH DE number 1775434 (Why is no real title available?) | 2002-08-01 | Paper |
The complexification and degree of a semi-algebraic set.
Mathematische Zeitschrift | 2002-06-18 | Paper |
Complexity of Null- and Positivstellensatz proofs
Annals of Pure and Applied Logic | 2002-03-13 | Paper |
Complexity of computing the local dimension of a semialgebraic set
Journal of Symbolic Computation | 2000-07-18 | Paper |
| scientific article; zbMATH DE number 1306858 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1254270 (Why is no real title available?) | 1999-04-22 | Paper |
Complexity lower bounds for computation trees with elementary transcendental function gates
Theoretical Computer Science | 1997-09-09 | Paper |
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Discrete & Computational Geometry | 1997-03-23 | Paper |
Complexity of stratifications of semi-Pfaffian sets
Discrete & Computational Geometry | 1995-08-01 | Paper |
Complexity of finding irreducible components of a semialgebraic set
Journal of Complexity | 1995-04-05 | Paper |
Finding irreducible components of some real transcendental varieties
Computational Complexity | 1994-09-01 | Paper |
Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
Journal of Soviet Mathematics | 1993-09-15 | Paper |
| scientific article; zbMATH DE number 177498 (Why is no real title available?) | 1993-05-18 | Paper |
Counting connected components of a semialgebraic set in subexponential time
Computational Complexity | 1993-04-01 | Paper |
Finding connected components of a semialgebraic set in subexponential time
Applicable Algebra in Engineering, Communication and Computing | 1992-09-27 | Paper |
Finding connected components of a semialgebraic set in subexponential time
Journal of Mathematical Sciences (New York) | 1992-09-27 | Paper |
The complexity of deciding consistency of systems of polynomials in exponent inequalities
Journal of Symbolic Computation | 1992-09-26 | Paper |
| scientific article; zbMATH DE number 16666 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 21309 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 8550 (Why is no real title available?) | 1992-06-25 | Paper |
| Determination of the connected components of a semialgebraic set in subexponential time | 1991-01-01 | Paper |
Solving systems of polynomial inequalities over a real closed field in subexponential time
Journal of Soviet Mathematics | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4157784 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4119512 (Why is no real title available?) | 1988-01-01 | Paper |
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation | 1988-01-01 | Paper |
Estimates of real roots of a system of algebraic equations
Journal of Soviet Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982411 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3870491 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3788682 (Why is no real title available?) | 1982-01-01 | Paper |
