Narrow proofs may be maximally long. (2014)

by Albert Atserias, Massimo Lauria, Jakob Nordstrom
Venue:In Proceedings of the 29th Annual IEEE Conference on Computational Complexity (CCC ’14),