Hubie Chen. Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. In Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, Davide Sangiorgi, editors, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. Volume 55 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{Chen16-59,
title = {Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness},
author = {Hubie Chen},
year = {2016},
doi = {10.4230/LIPIcs.ICALP.2016.94},
url = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.94},
researchr = {https://researchr.org/publication/Chen16-59},
cites = {0},
citedby = {0},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
volume = {55},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-013-2},
}