@InProceedings{ghasemloo_et_al:LIPIcs.CSL.2013.296,
author = {Ghasemloo, Kaveh and Cook, Stephen A.},
title = {{Theories for Subexponential-size Bounded-depth Frege Proofs}},
booktitle = {Computer Science Logic 2013 (CSL 2013)},
pages = {296--315},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-60-6},
ISSN = {1868-8969},
year = {2013},
volume = {23},
editor = {Ronchi Della Rocca, Simona},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.296},
URN = {urn:nbn:de:0030-drops-42044},
doi = {10.4230/LIPIcs.CSL.2013.296},
annote = {Keywords: Computational Complexity Theory, Proof Complexity, Bounded Arithmetic, NC1-Frege, AC0- Frege}
}