Cody D. Murray, Richard Ryan Williams. On the (Non) NP-Hardness of Computing Circuit Complexity. In David Zuckerman, editor, 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA. Volume 33 of LIPIcs, pages 365-380, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{MurrayW15,
title = {On the (Non) NP-Hardness of Computing Circuit Complexity},
author = {Cody D. Murray and Richard Ryan Williams},
year = {2015},
doi = {10.4230/LIPIcs.CCC.2015.365},
url = {http://dx.doi.org/10.4230/LIPIcs.CCC.2015.365},
researchr = {https://researchr.org/publication/MurrayW15},
cites = {0},
citedby = {0},
pages = {365-380},
booktitle = {30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA},
editor = {David Zuckerman},
volume = {33},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-81-1},
}