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

Authors:
Nikolaj N. Vorobjov, Jr.
Affiliations:
Leningrad Department of Mathematics, Steklov Institute of the Academy of Sciences of the USSR, Fontanka emb. 27, Leningrad 191011, USSR
Venue:
Journal of Symbolic Computation
Year:
1992

Citing 8
Cited 2

The complexity of elementary algebra and geometry

Journal of Computer and System Sciences
Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation
Complexity of deciding Tarski algebra

Journal of Symbolic Computation
Integer Arithmetic Algorithms for Polynomial Real Zero Determination

Journal of the ACM (JACM)
Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields

Proceedings of the Mathematical Foundations of Computer Science 1984
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Ein Entscheidungsverfahren für die Theorie der reell- abgeschlossenen Körper

Komplexität von Entscheidungsproblemen, Ein Seminar
A faster PSPACE algorithm for deciding the existential theory of the reals

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Solution of elementary systems of equations in a box in Rn

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
New complexity bounds for cylindrical decompositions of sub-pfaffian sets

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Suppose the polynomials P"1..., P"k@?@?[X"1,...,X"n, U], h@?@?[X"1,...,X"n] have degrees deg(P"i), deg(h)=0,...,P"k(X"1,...,X"n, e^h^(^X^"^1^,^...^,^X^"^n)=0 within time polynomial in M(nkd)^n^^^4.