Albert Atserias, Massimo Lauria, Jakob Nordström. Narrow Proofs May Be Maximally Long. Electronic Colloquium on Computational Complexity (ECCC), 21:118, 2014. [doi]
No references recorded for this publication.
No citations of this publication recorded.