Solving systems of polynomial inequalities over a real closed field in subexponential time
From MaRDI portal
Publication:804242
DOI10.1007/BF01098273zbMATH Open0726.65070MaRDI QIDQ804242FDOQ804242
Nicolai Vorobjov, Dima Grigoriev
Publication date: 1991
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Recommendations
- Publication:4733314
- Solving systems of polynomial inequalities in subexponential time
- scientific article; zbMATH DE number 3982411
- scientific article; zbMATH DE number 16666
- scientific article
- An improvement of the complexity bound for solving systems of polynomial equations
- Efficient solution of real polynomial systems of equations
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
- Polynomial-time solution of initial value problems using polynomial enclosures
- On the complexity exponent of polynomial system solving
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inequalities for trigonometric functions and polynomials (26D05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Betti Numbers of Real Varieties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Definability and fast quantifier elimination in algebraically closed fields
- Solving systems of polynomial inequalities in subexponential time
- Title not available (Why is that?)
- The complexity of elementary algebra and geometry
- Integer Arithmetic Algorithms for Polynomial Real Zero Determination
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Solving systems of polynomial inequalities over a real closed field in subexponential time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804242)
