Natural SciencesComputer ScienceMathematicsAlgorithmsNumber TheoryTheory Of ComputationAlgebraic Number TheoryCoding TheoryComputational AlgebraComputational ComplexityComputational Number TheoryNumber-theoretic AlgorithmsAlgorithmic Number TheoryFinite Field ArithmeticFinite Field ComputationPolynomial Factorization Over Finite FieldsProbabilistic Analysis Of AlgorithmsProbabilistic Number-theoretic Algorithms
5
Probabilistic Algorithms in Finite Fields
Michael O. Rabin · SIAM Journal on Computing · 1980 · 319 citations
Factoring Polynomials Over Large Finite Fields
Elwyn R. Berlekamp · Mathematics of Computation · 1970 · 144 citations
Proof of a conjecture of S. Chowla
Rimhak Ree · Journal of Number Theory · 1971 · 24 citations