Noga Ron-Zewi, Ron D. Rothblum. Proving as fast as computing: succinct arguments with constant prover overhead. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 1353-1363, ACM, 2022. [doi]
No references recorded for this publication.
No citations of this publication recorded.