Deciding consistency of systems of exponential-polynomial inequalities in subexponential time

DOI10.1007/BF01104104zbMath0780.65034MaRDI QIDQ684954

Nikolaj N. jun. Vorob'ev

Publication date: 15 September 1993

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

zbMATH Keywords

first order theory of reals with exponentiationrecognition of consistencysubexponential-time algorithmssystems of polynomial inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

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

This page was built for publication: Deciding consistency of systems of exponential-polynomial inequalities in subexponential time