Abstract
An algorithm is proposed for producing all components of the varieties defined by equations which involve polynomials and exponentials of polynomials, irreducible over real algebraic numbers. The running time of the algorithm is singly exponential in the number of variables and, with this number fixed, polynomial in all other parameters of the input.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Bochnak, M. Coste, andM.-F. Roy,Géométrie Algébrique Réelle. Springer-Verlag, Berlin, 1987.
A. L. Chistov, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. InZapiski Nauchnykh Seminarov LOMI 137 (1984), 124–188. English translation inJ. Soviet Math. 34 (1986), 1838–1882.
M. Davis,Applied Nonstandard Analysis. J. Wiley, New York, 1977.
A. Galligo and N. Vorobjov, Finding irreducible components of a real algebraic variety in subexponential time. Manuscript, 1992.
D. Yu. Grigoriev, Factorization of polynomials over a finite field and the solution of systems of algebraic equations. InZapiski Nauchnykh Seminarov LOMI 137 (1984), 20–79. English translation inJ. Soviet Math. 34 (1986), 1762–1803.
D. Yu. Grigoriev, The complexity of deciding Tarski algebra.J. Symbolic Comput. 5 (1988), 65–108.
D. Yu. Grigoriev andN. Vorobjov, Solving systems of polynomial inequalities in subexponentiual time.J. Symbolic Comput. 5 (1988), 37–64.
R. Hartshorn,Algebraic Geometry. Springer-Verlag, Berlin, 1977.
J. Heintz, M.-F. Roy, andP. Solernó, Sur la complexité du principe de Tarski-Seidenberg.Bull. Soc. Math. France 118 (1990), 101–126.
J. Heintz, M.-F. Roy, andP. Solernó, Single exponential path finding in semialgebraic sets II: The general case. InAlgebraic Geometry and its Applications, Springer-Verlag, Berlin, 1993, 467–481.
E. Kaltofen, Computing the irreducible real factors and components of an algebraic curve.Appl. Alg. Eng. Comm. Comp. 1, (1990), 135–148.
J. Renegar, On the computational complexity and geometry of the first order theory of reals.J. Symbolic Comput. 13 (1992), 329–352.
I. R. Shafarevich,Basic Algebraic Geometry. Springer-Verlag, Berlin, 1974.
N. Vorobjov, Deciding consistency of systems of polynomial in exponent inequalities in subexponential time. InEffective Methods in Algebraic Geometry, Birkhäuser, Boston, 1991, 491–501.
N. Vorobjov, The complexity of deciding consistency of systems of polynomial in exponent inequalities.J. Symbolic Comput. 13 (1992), 139–173.
H. Whitney, Elementary structure of real algebraic varieties.Ann. Math. 66 (1957), 456–467.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Roy, MF., Vorobjov, N. Finding irreducible components of some real transcendental varieties. Comput Complexity 4, 107–132 (1994). https://doi.org/10.1007/BF01202285
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01202285