Polynomial-time algorithms for the factorization of polynomials

In 1982 a polynomial-time algorithm for factoring polynomials in one variable with rational coefficients was published (see A.K. Lenstra, H.W. Lenstra, Jr. and L. Lovasz, Math. Ann., vol.261, p.515-34, 1982). This <i>L</i><sup>3</sup>-algorithm came as a rather big surprise: hardly anybody expected that the problem allowed solution in polynomial time. The purpose of this note is to present an informal description of the L<sup>3</sup>-algorithm


Published in:
Bulletin of the European Association for Theoretical Computer Science, 23, 59 - 76
Year:
1984
ISSN:
0252-9742
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)