The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in n^12+o(1) rounds

DOI10.1145/3476446.3536183MaRDI QIDQ6665752FDOQ6665752

Authors: Erich L. Kaltofen 

Publication date: 17 January 2025

zbMATH Keywords

cloud computingprimality testingproof-of-work certificate

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

This page was built for publication: The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in \(n^{\frac{1}{2}+o(1)}\) rounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665752)