![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/mfcs/AradBGSSZ16
@inproceedings{DBLP:conf/mfcs/AradBGSSZ16, author = {Itai Arad and Adam Bouland and Daniel Grier and Miklos Santha and Aarthi Sundaram and Shengyu Zhang}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, title = {On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland}, series = {LIPIcs}, volume = {58}, pages = {12:1--12:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.12}, doi = {10.4230/LIPICS.MFCS.2016.12}, timestamp = {Thu, 01 Dec 2022 16:11:58 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/AradBGSSZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.