@InProceedings{arad_et_al:LIPIcs.MFCS.2016.12,
author = {Arad, Itai and Bouland, Adam and Grier, Daniel and Santha, Miklos and Sundaram, Aarthi and Zhang, Shengyu},
title = {{On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.12},
URN = {urn:nbn:de:0030-drops-64284},
doi = {10.4230/LIPIcs.MFCS.2016.12},
annote = {Keywords: computational complexity, satisfiability problems, trial and error, quantum computing, learning theory}
}