Journal of Computer and System Sciences · 1985 · 92 citations · 13 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationAlgebraic GeometryAlgebraic ProofPolynomial Time ComplexityPolynomial-time AlgorithmsSolvability By Radicals
13
Factoring polynomials with rational coefficients
A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text
Franklin Haimo, Helmut Wielandt · American Mathematical Monthly · 1966 · 1.7K citations
Polynomial-time algorithms for permutation groups
Merrick L. Furst, John E. Hopcroft, Eugene M. Luks · 1980 · 252 citations