Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran 0001. Communication Complexity vs Randomness Complexity in Interactive Proofs. Electronic Colloquium on Computational Complexity (ECCC), TR24, 2024. [doi]
@article{ApplebaumB024,
title = {Communication Complexity vs Randomness Complexity in Interactive Proofs},
author = {Benny Applebaum and Kaartik Bhushan and Manoj Prabhakaran 0001},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/105},
researchr = {https://researchr.org/publication/ApplebaumB024},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {TR24},
}