Kaltofen, E. L. (2022). The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, 177. https://doi.org/10.1145/3476446.3536183
Παραπομπή σε μορφή Chicago (17η εκδ.)Kaltofen, Erich L. "The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in N1/2+o(1) Rounds." Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation 2022: 177. https://doi.org/10.1145/3476446.3536183.
Παραπομπή σε μορφή MLA (9th εκδ.)Kaltofen, Erich L. "The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in N1/2+o(1) Rounds." Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, 2022, p. 177, https://doi.org/10.1145/3476446.3536183.