On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. (bibtex)
by Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang
Reference:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. (Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang), In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, volume 58, 2016.
Bibtex Entry:
@proceedings{conf/mfcs/2016,
	Booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland},
	Date-Added = {2019-02-24 13:05:01 +0100},
	Date-Modified = {2019-02-24 13:05:01 +0100},
	Publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
	Series = {LIPIcs},
	Volume = {58},
	Year = {2016}}
@inproceedings{conf/mfcs/AradBGSSZ16,
	Author = {Itai Arad and Adam Bouland and Daniel Grier and Miklos Santha and Aarthi Sundaram and Shengyu Zhang},
	Crossref = {conf/mfcs/2016},
	Date-Added = {2019-02-24 13:05:01 +0100},
	Date-Modified = {2019-02-24 15:26:57 +0100},
	Keywords = {c-acti,irif,Santha,eq-ac},
	Pages = {12:1-12:14},
	Title = {On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.},
	Year = {2016},
	Bdsk-Url-1 = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.12}}
Powered by bibtexbrowser