Albert Atserias, Massimo Lauria, Jakob Nordström. Narrow Proofs May Be Maximally Long. Electronic Colloquium on Computational Complexity (ECCC), 21:118, 2014. [doi]
@article{AtseriasLN14-0,
title = {Narrow Proofs May Be Maximally Long},
author = {Albert Atserias and Massimo Lauria and Jakob Nordström},
year = {2014},
url = {http://eccc.hpi-web.de/report/2014/118},
researchr = {https://researchr.org/publication/AtseriasLN14-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {21},
pages = {118},
}