@InProceedings{ezra_et_al:LIPIcs.ITCS.2022.67,
author = {Ezra, Michael and Rothblum, Ron D.},
title = {{Small Circuits Imply Efficient Arthur-Merlin Protocols}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {67:1--67:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.67},
URN = {urn:nbn:de:0030-drops-156635},
doi = {10.4230/LIPIcs.ITCS.2022.67},
annote = {Keywords: Circuits Complexity, Circuit Lower Bounds, Communication Complexity, Data Streaming, Arthur-Merlin games, Interactive Proofs}
}