scientific article; zbMATH DE number 16666

MaRDI QIDQ3973352zbMATH OpenFDO

Authors Nicolai Vorobjov

Publication date 26 June 1992

zbMATH Keywords

algorithmexponentiationreal solutionssystems of polynomial inequalities

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Real algebraic sets (14P05) Symbolic computation and algebraic computation (68W30)

Recommendations

• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• scientific article; zbMATH DE number 1254283
• scientific article; zbMATH DE number 4157784
• Solving systems of polynomial inequalities in subexponential time
• Publication:4733314

Cited in

(11)

• Solving systems of polynomial inequalities in subexponential time
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• Finding irreducible components of some real transcendental varieties
• scientific article; zbMATH DE number 4157784 (Why is no real title available?)
• scientific article; zbMATH DE number 3982411 (Why is no real title available?)
• scientific article; zbMATH DE number 1263313 (Why is no real title available?)
• Power circuits, exponential algebra, and time complexity
• scientific article; zbMATH DE number 4119512 (Why is no real title available?)
• Deciding polynomial-exponential problems
• Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability
• Solving systems of polynomial inequalities over a real closed field in subexponential time

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 Q3973352)