%0 Conference Paper %1 conf/mfcs/AradBGSSZ16 %A Arad, Itai %A Bouland, Adam %A Grier, Daniel %A Santha, Miklos %A Sundaram, Aarthi %A Zhang, Shengyu %B MFCS %D 2016 %E Faliszewski, Piotr %E Muscholl, Anca %E Niedermeier, Rolf %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 12:1-12:14 %T On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#AradBGSSZ16 %V 58 %@ 978-3-95977-016-3

@inproceedings{conf/mfcs/AradBGSSZ16, added-at = {2022-12-01T00:00:00.000+0100}, author = {Arad, Itai and Bouland, Adam and Grier, Daniel and Santha, Miklos and Sundaram, Aarthi and Zhang, Shengyu}, biburl = {https://www.bibsonomy.org/bibtex/29c0e5f7b93ce86faa4774ca0283d2cf8/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/2016}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, ee = {https://doi.org/10.4230/LIPIcs.MFCS.2016.12}, interhash = {1f88863989f1b30fa424746e5c59b98d}, intrahash = {9c0e5f7b93ce86faa4774ca0283d2cf8}, isbn = {978-3-95977-016-3}, keywords = {dblp}, pages = {12:1-12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-10T13:07:27.000+0200}, title = {On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#AradBGSSZ16}, volume = 58, year = 2016 }