Effective Methods in Algebraic Geometry pp 217-225 | Cite as
On the Complexity of Zero-dimensional Algebraic Systems
Abstract
A probabilistic algorithm is given which, a zero-dimensional system of polynomials being given, computes Gröbner base for any ordering of its radical and/or all of its irreducible components in time d O(n) where d is the maximal degree of the polynomials and n the number of variables. With probability nearly 1, no component is lost.
This algorithm can decide zero-dimensionality with the same complexity and the same probability of success.
These complexities remain valid even if the system is not zero-dimensional at infinity.
This algorithm is a pratical one; it is probably slower than the computation of the Gröbner base for a degree ordering but faster than the same computation with a variable more.
Keywords
Irreducible Component Algebraic Closure Common Zero Random Integer Probabilistic AlgorithmPreview
Unable to display preview. Download preview PDF.
References
- [1]Canny, J., Generalized characteristic polynomials, in “Symbolic and algebraic computation, proc. ISSAC’88, ” Lect. Notes in Comp. Sci. 358, Springer Verlag, 1989, pp. 293–299.MathSciNetCrossRefGoogle Scholar
- [2]Faugère, J.C., Gianni, P., Lazard, D., Mora, T., Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering, (submitted), J. Symb. Comp. (1989). Technical Report LITP 89-52Google Scholar
- [3]Gianni, P. and Mora T., Algebraic Solution of Systems of Polynomial Equations using Gröbner Bases, Preprint, 1988.Google Scholar
- [4]Grigoriev, D., Chistov, Subexponential-time Solving Systems of Algebraic Equations, Preprints LOMI E-9-83 and E-10-83, Leningrad 1983.Google Scholar
- [5]Ierardi, D., The complexity of quantifier elimination in the theory of algebraically closed fields, Ph.D. Thesis, Cornell University, 1989.Google Scholar
- [6]Kaplanski, I., “Commutative rings,” Allyn and Bacon, Boston, 1981.Google Scholar
- [7]Kobayashi, H., Fujise, T., Furukawa, A., Solving Systems of Algebraic Equations by General Elimination Method, J. Symb. Comp. 5 (1988), 303–320.MathSciNetMATHCrossRefGoogle Scholar
- [8]Kobayashi, H., Moritsugu, S., Hogan, R.W., On Solving Systems of Algebraic Equations, in “Proc. ISSAC 88,” 1988.Google Scholar
- [9]Lakshman, Y. N., On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal, in “Proc. STOCS’90,” 1990.Google Scholar
- [10]Lakshman, Y. N., A single exponential bound on the complexity of computing Gröbner bases of zero dimensional ideals, (in these proceedings).Google Scholar
- [11]Lazard, D., Résolution des Systèmes d’Equations Algébriques, Theor. Comp. Sci. 15 (1981), 77–110.MathSciNetMATHCrossRefGoogle Scholar
- [12]Lazard, D., Gröbner Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations, in “Proc. EUROCAL 83,” Lect. Notes in Comp. Sci. 162, Springer, 1983, pp. 146–157.MathSciNetGoogle Scholar
- [13]Lazard, D., Solving zero-dimensional algebraic systems, (submitted), J. Symb. Comp. (1989). Technical Report LITP 89-48.Google Scholar
- [14]Macaulay, F.S., “The Algebraic Theory of Modular Systems,” Cambridge Tracts in Math. 19, Cambridge Univ. Press, 1916. Stechert-Hafner (1964)Google Scholar