scientific article; zbMATH DE number 16666

zbMATH Open0746.03009MaRDI QIDQ3973352FDOQ3973352

Nicolai Vorobjov

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

algorithmexponentiationreal solutionssystems of polynomial inequalities

Mathematics Subject Classification ID

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

Cited In (9)

• Finding irreducible components of some real transcendental varieties
• Deciding polynomial-exponential problems
• Solving systems of polynomial inequalities in subexponential time
• Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

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)