Factoring polynomials over algebraic number fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 162 LNCS, Issue , 1983, Pages 245-254

  Lenstra, A K ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

ALGEBRAIC NUMBER FIELDS; POLYNOMIAL-TIME ALGORITHMS; UNIVARIATE;

ALGEBRA;

EID: 85031899865     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-12868-9_108     Document Type: Conference Paper

References (11)

1. E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970), 713–735.
2. W.S. Brown, The subresultant PRS algorithm, ACM Transactions on mathematical software 4 (1978), 237–249.
3. A.J. Goldstein, R.L. Graham, A Hadamard-type bound on the coefficients of a determinant of polynomials, SIAM Rev. 16 (1974), 394–395.
4. D.E. Knuth, The art of computer programming, vol. 2, Seminumerical algorithms, Addison Wesley, Reading, second edition 1981.
5. S. Landau, Factoring polynomials over algebraic number fields is in polynomial-time, unpublished manuscript, 1982.
6. A.K. Lenstra, Lattices and factorization of polynomials over algebraic number fields, Proceedings Eurocam 82, LNCS 144, 32–39.
7. A.K. Lenstra, H.W. Lenstra Jr., L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.
8. A.K. Lenstra, Factoring polynomials over algebraic number fields, Report IW 213/82, Mathematisch Centrum, Amsterdam 1982.
9. M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28 (1974), 1153–1157.
10. P.J. Weinberger, L.P. Rothschild, Factoring polynomials over algebraic number fields, ACM Transactions on mathematical software 2 (1976), 335–350.
11. D.Y.Y. Yun, The Hensel lemma in algebraic manipulation, MIT, Cambridge 1974; reprint: Garland Publ. Co., New York 1980.