Mathematics

A. Lenstra, H. Lenstra, L. Lovász

1982.12.1MATHEMATISCHE ANNALEN

DOI: 10.1007/bf01457454

tlooto Summary

This paper presents a polynomial-time algorithm to solve the following problem: given a non-zeroPolynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q (X).

Abstract

Abstract is not available.

Citation format

LENSTRA, A.; LENSTRA, H.; LOVÁSZ, L. Factoring polynomials with rational coefficients. MATHEMATISCHE ANNALEN, 1982, 261: 515–534.