Factoring polynomials over algebraic number fields (original) (raw)
- 264 Accesses
- 45 Citations
- 2 Altmetric
Abstract
We present a polynomial-time algorithm for the factorization of univariate polynomials over algebraic number fields. Our algorithm is a direct generalization of the polynomial-time algorithm for the factorization of univariate polynomials over the rationals [7].
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
- E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970), 713–735.
Google Scholar - W.S. Brown, The subresultant PRS algorithm, ACM Transactions on mathematical software 4 (1978), 237–249.
Google Scholar - A.J. Goldstein, R.L. Graham, A Hadamard-type bound on the coefficients of a determinant of polynomials, SIAM Rev. 16 (1974), 394–395.
Google Scholar - D.E. Knuth, The art of computer programming, vol. 2, Seminumerical algorithms, Addison Wesley, Reading, second edition 1981.
Google Scholar - S. Landau, Factoring polynomials over algebraic number fields is in polynomial-time, unpublished manuscript, 1982.
Google Scholar - A.K. Lenstra, Lattices and factorization of polynomials over algebraic number fields, Proceedings Eurocam 82, LNCS 144, 32–39.
Google Scholar - A.K. Lenstra, H.W. Lenstra, Jr., L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.
Google Scholar - A.K. Lenstra, Factoring polynomials over algebraic number fields, Report IW 213/82, Mathematisch Centrum, Amsterdam 1982.
Google Scholar - M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28 (1974), 1153–1157.
Google Scholar - P.J. Weinberger, L.P. Rothschild, Factoring polynomials over algebraic number fields, ACM Transactions on mathematical software 2 (1976), 335–350.
Google Scholar - D.Y.Y. Yun, The Hensel lemma in algebraic manipulation, MIT, Cambridge 1974; reprint: Garland Publ. Co., New York 1980.
Google Scholar
Author information
Authors and Affiliations
- Mathematisch Centrum, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands
A. K. Lenstra
Editor information
J. A. van Hulzen
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Lenstra, A.K. (1983). Factoring polynomials over algebraic number fields. In: van Hulzen, J.A. (eds) Computer Algebra. EUROCAL 1983. Lecture Notes in Computer Science, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12868-9\_108
Download citation
- .RIS
- .ENW
- .BIB
- DOI: https://doi.org/10.1007/3-540-12868-9\_108
- Published: 29 May 2005
- Publisher Name: Springer, Berlin, Heidelberg
- Print ISBN: 978-3-540-12868-7
- Online ISBN: 978-3-540-38756-5
- eBook Packages: Springer Book Archive