Go to the corresponding LIPIcs Volume Portal 
Arad, Itai ; Bouland, Adam ; Grier, Daniel ; Santha, Miklos ; Sundaram, Aarthi ; Zhang, Shengyu
pdfformat: 

@InProceedings{arad_et_al:LIPIcs:2016:6428, author = {Itai Arad and Adam Bouland and Daniel Grier and Miklos Santha and Aarthi Sundaram and Shengyu Zhang}, 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:112:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770163}, ISSN = {18688969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6428}, URN = {urn:nbn:de:0030drops64284}, doi = {10.4230/LIPIcs.MFCS.2016.12}, annote = {Keywords: computational complexity, satisfiability problems, trial and error, quantum computing, learning theory} }
Keywords:  computational complexity, satisfiability problems, trial and error, quantum computing, learning theory  
Seminar:  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  
Issue Date:  2016  
Date of publication:  19.08.2016 