Solving systems of polynomial inequalities over a real closed field in subexponential time

DOI10.1007/BF01098273zbMath0726.65070MaRDI QIDQ804242

Nikolaj N. jun. Vorob'ev, Dima Yu. Grigoriev

Publication date: 1991

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithminfinitesimal calculussystems of polynomial inequalitiescomplexity of calculus

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inequalities for trigonometric functions and polynomials (26D05)

Cites Work

• Definability and fast quantifier elimination in algebraically closed fields
• The complexity of elementary algebra and geometry
• Solving systems of polynomial inequalities in subexponential time
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving systems of polynomial inequalities over a real closed field in subexponential time