Conference
The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds
| Τίτλος: | The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds |
|---|---|
| Συγγραφείς: | Kaltofen, Erich L. |
| Πηγή: | Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. :177-186 |
| Διαθεσιμότητα: | http://dl.acm.org/doi/10.1145/3476446.3536183 |
| Βάση Δεδομένων: | ACM Full-Text Collection |
καταχωρήστε σχόλιο πρώτοι!