Abstract
In this paper we describe a new algorithm for fully factoring polynomials defined over the rationals or over number-fields. This algorithm uses as an essential subroutine, any fast relation finding algorithm for vectors of real numbers. Unlike previous algorithms which work on one factor at a time, the new algorithm finds all factors at once. Let P be a polynomial of degree n, height H(P) (=sum of the absolute values of P's coefficients), logarthmic height h(P)=log H(P). If we use the HJLS relation-finding algorithm of Hastad, Just, Lagarias and Schnorr, our algorithm has running time O(n 5+Ch(P)) if fast multiplication is used, and O(n 6+Ch(P)) if ordinary multiplication is used. This is an improvement by a factor of n over the algorithm of Schönhage, the previously best known.
This article was processed using the LATEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
David H. Bailey and Helaman R. P. Ferguson. Numerical results on relations between fundamental constants using a new algorithm. Math. Comp., 53:649–656, 1989.
Helaman R. P. Ferguson and David H. Bailey. A polynomial time, numerically stable integer relation algorithm. Technical report, Supercomputing Research Center, 17100 Science Drive, Bowie, MD 20715, December 1991.
Patrizia Gianni, Victor Miller, and Barry Trager. Decomposition of algebras. In ISAAC '88, Lecture Notes in Computer Science. Springer-Verlag, 1989.
Johann Hastad, B. Just, Jeffrey C. Lagarias, and Claus P. Schnorr. Polynomial time algorithms for finding integer relations among real numbers. Siam J. Comput., 18:859–881, 1989.
Ravi Kannan and Lyle A. McGeoch. Basis reduction and evidence for transcendence of certain numbers. In Foundations of software technology and theoretical computer science (New Delhi, 1986), volume 241 of Lecture Notes in Comput. Sci., pages 263–269. Springer, Berlin-New York, 1986.
Arjen K. Lenstra, Hendrik W. Lenstra, Jr., and Laszlo Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515–534, 1982.
Kurt Mahler. An inequality for the discriminant of a polynomial. Michigan Math. J., 11:257–262, 1964
Arnold Schönhage. The fundamental theorem of algebra in terms of computational complexity. Technical report, Math. Inst. Univ. Tübingen, 1982.
Arnold Schönhage. Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm. In Automata, languages and programming (Antwerp, 1984), volume 172 of Lecture Notes in Computer Science, pages 436–447, Berlin-New York, 1984. Springer-Verlag.
Arnold Schönhage. Equation solving in terms of computational complexity. In Proceedings of the International Congress of Mathematicians, 1986, volume 1, pages 131–153. American Mathematical Society, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, V.S. (1992). Factoring polynomials via relation-finding. In: Dolev, D., Galil, Z., Rodeh, M. (eds) Theory of Computing and Systems. ISTCS 1992. Lecture Notes in Computer Science, vol 601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035171
Download citation
DOI: https://doi.org/10.1007/BFb0035171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55553-7
Online ISBN: 978-3-540-47214-8
eBook Packages: Springer Book Archive