The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds.

Erich L. Kaltofen

Browse the full ISSAC paper archive.