Erich L. Kaltofen. The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. In Marc Moreno Maza, Lihong Zhi, editors, ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022. pages 177-186, ACM, 2022. [doi]
@inproceedings{Kaltofen22,
title = {The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds},
author = {Erich L. Kaltofen},
year = {2022},
doi = {10.1145/3476446.3536183},
url = {https://doi.org/10.1145/3476446.3536183},
researchr = {https://researchr.org/publication/Kaltofen22},
cites = {0},
citedby = {0},
pages = {177-186},
booktitle = {ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022},
editor = {Marc Moreno Maza and Lihong Zhi},
publisher = {ACM},
isbn = {978-1-4503-8688-3},
}