@InProceedings{arnon_et_al:LIPIcs.CCC.2022.24,
author = {Arnon, Gal and Chiesa, Alessandro and Yogev, Eylon},
title = {{Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {24:1--24:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.24},
URN = {urn:nbn:de:0030-drops-165867},
doi = {10.4230/LIPIcs.CCC.2022.24},
annote = {Keywords: hardness of approximation, interactive oracle proofs, stochastic satisfaction problems}
}