Deterministically testing sparse polynomial identities of unbounded degree

Fast Probabilistic Algorithms for Verification of Polynomial Identities

Jacob T. Schwartz · Journal of the ACM · 1980 · 1.7K citations · Full text

Computing, Computer Science, Mathematics +8

Modern computer algebra

Choice Reviews Online · 2000 · 1.6K citations

Natural Sciences, Computer Science, Algebra +5

Proof verification and the hardness of approximation problems

Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text

Computing, Computer Science, Mathematics +14

Probabilistic checking of proofs

Sanjeev Arora · Journal of the ACM · 1998 · 1.2K citations · Full text

Computing, Computer Science, Mathematics +14

PRIMES is in P

Manindra Agrawal, Neeraj Kayal, Nitin Saxena · Annals of Mathematics · 2004 · 922 citations · Full text

Computing, Computer Science, Mathematics +10