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

DOI10.1016/S0747-7171(08)80088-0zbMATH Open0784.68046MaRDI QIDQ1190747FDOQ1190747

Authors: Nicolai Vorobjov 

Publication date: 26 September 1992

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

Recommendations

• scientific article; zbMATH DE number 16666
• Deciding consistency of systems of exponential-polynomial inequalities in subexponential time
• scientific article; zbMATH DE number 4157784
• On the complexity exponent of polynomial system solving
• Complexity of the resolution of parametric systems of polynomial equations and inequations
• An improvement of the complexity bound for solving systems of polynomial equations
• scientific article; zbMATH DE number 1285794
• On the complexity of solving a bivariate polynomial system
• Solving systems of polynomial inequalities in subexponential time
• Complexity of solving parametric polynomial systems

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 in algebraic geometry (14Q99) Nonstandard models of arithmetic (03H15) Computational aspects and applications of commutative rings (13P99)

Cites Work

• Differential Topology
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Betti Numbers of Real Varieties
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving systems of polynomial inequalities in subexponential time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity of deciding Tarski algebra
• Title not available (Why is that?)
• The complexity of elementary algebra and geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Finding irreducible components of some real transcendental varieties
• Complexity lower bounds for computation trees with elementary transcendental function gates
• Decision problem for a class of univariate Pfaffian functions
• Deciding polynomial-exponential problems
• Complexity of stratifications of semi-Pfaffian sets
• Complexity of cylindrical decompositions of sub-Pfaffian
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Zero counting for a class of univariate Pfaffian functions
• Recent advances in real geometric reasoning

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

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