The complexity of deciding consistency of systems of polynomials in exponent inequalities

DOI10.1016/S0747-7171(08)80088-0zbMath0784.68046MaRDI QIDQ1190747

Nikolaj N. jun. Vorob'ev

Publication date: 26 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

decidabilityalgebraic complexitynon-standard analysisexponent polynomialspolynomials in exponent inequalities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Computational aspects and applications of commutative rings (13P99) Nonstandard models of arithmetic (03H15) Computational aspects in algebraic geometry (14Q99)

Related Items (7)

Finding irreducible components of some real transcendental varieties ⋮ Recent Advances in Real Geometric Reasoning ⋮ Complexity of stratifications of semi-Pfaffian sets ⋮ Complexity lower bounds for computation trees with elementary transcendental function gates ⋮ Decision problem for a class of univariate Pfaffian functions ⋮ Complexity of cylindrical decompositions of sub-Pfaffian ⋮ Zero counting for a class of univariate Pfaffian functions

Cites Work

• The complexity of elementary algebra and geometry
• Solving systems of polynomial inequalities in subexponential time
• Complexity of deciding Tarski algebra
• Differential Topology
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of deciding consistency of systems of polynomials in exponent inequalities