Baris Aydinlioglu, Dieter van Melkebeek. Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games. Electronic Colloquium on Computational Complexity (ECCC), 19:80, 2012. [doi]
@article{AydinliogluM12-0,
title = {Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games},
author = {Baris Aydinlioglu and Dieter van Melkebeek},
year = {2012},
url = {http://eccc.hpi-web.de/report/2012/080},
researchr = {https://researchr.org/publication/AydinliogluM12-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {19},
pages = {80},
}