scientific article; zbMATH DE number 4157784

MaRDI QIDQ3485804zbMATH OpenFDO

Authors Nicolai Vorobjov

Publication date 1989

Full work available at URL https://eudml.org/doc/68043

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)

Recommendations

• scientific article; zbMATH DE number 16666
• Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
• Solving systems of polynomial inequalities in subexponential time
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• Publication:4733314
• Solving systems of polynomial inequalities over a real closed field in subexponential time
• scientific article; zbMATH DE number 3982411
• On the complexity exponent of polynomial system solving
• scientific article; zbMATH DE number 1285794
• An improvement of the complexity bound for solving systems of polynomial equations

Cited in

(8)

• Solving systems of polynomial inequalities in subexponential time
• scientific article; zbMATH DE number 16666 (Why is no real title available?)
• scientific article; zbMATH DE number 3982411 (Why is no real title available?)
• scientific article; zbMATH DE number 4119512 (Why is no real title available?)
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• Solving systems of polynomial inequalities over a real closed field in subexponential time
• Recent advances in real geometric reasoning
• Deciding polynomial-exponential problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485804)