The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in n^12+o(1) rounds
From MaRDI portal
Publication:6665752
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)
