@InProceedings{williams:LIPIcs.CCC.2016.2,
author = {Williams, Richard Ryan},
title = {{Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {2:1--2:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.2},
URN = {urn:nbn:de:0030-drops-58307},
doi = {10.4230/LIPIcs.CCC.2016.2},
annote = {Keywords: counting complexity, exponential-time hypothesis, interactive proofs, Merlin-Arthur games}
}