Fast Construction of Irreducible Polynomials over Finite Fields

Matrix multiplication via arithmetic progressions

Don Coppersmith, S. Winograd · Journal of Symbolic Computation · 1990 · 2.3K citations

Computing, Computer Science, Mathematics +14

The complexity of partial derivatives

Walter Bäur, Volker Strassen · Theoretical Computer Science · 1983 · 482 citations

Natural Sciences, Mathematics, Derivatives +10

Fast solution of toeplitz systems of equations and computation of Padé approximants

Richard P. Brent, Fred G. Gustavson, David Y. Y. Yun · Journal of Algorithms · 1980 · 389 citations

Computing, Computer Science, Mathematics +14

On fast multiplication of polynomials over arbitrary algebras

David G. Cantor, Erich Kaltofen · Acta Informatica · 1991 · 387 citations

Natural Sciences, Computer Science, Mathematics +10

Probabilistic Algorithms in Finite Fields

Michael O. Rabin · SIAM Journal on Computing · 1980 · 319 citations

Natural Sciences, Computer Science, Mathematics +15