Baris Aydinlioglu, Dieter van Melkebeek. Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. In Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012. pages 269-279, IEEE, 2012. [doi]
@inproceedings{AydinliogluM12,
title = {Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games},
author = {Baris Aydinlioglu and Dieter van Melkebeek},
year = {2012},
doi = {10.1109/CCC.2012.32},
url = {http://doi.ieeecomputersociety.org/10.1109/CCC.2012.32},
researchr = {https://researchr.org/publication/AydinliogluM12},
cites = {0},
citedby = {0},
pages = {269-279},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012},
publisher = {IEEE},
isbn = {978-1-4673-1663-7},
}