Narrow Proofs May Be Maximally Long

Albert Atserias, Massimo Lauria, Jakob Nordström. Narrow Proofs May Be Maximally Long. Electronic Colloquium on Computational Complexity (ECCC), 21:118, 2014. [doi]

Authors

Albert Atserias

This author has not been identified. Look up 'Albert Atserias' in Google

Massimo Lauria

This author has not been identified. Look up 'Massimo Lauria' in Google

Jakob Nordström

This author has not been identified. Look up 'Jakob Nordström' in Google