On the Complexity of Finding Narrow Proofs

Christoph Berkholz. On the Complexity of Finding Narrow Proofs. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 351-360, IEEE Computer Society, 2012. [doi]

Abstract

Abstract is missing.