On the Complexity of Finding Narrow Proofs

Christoph Berkholz
2012 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science  
doi:10.1109/focs.2012.48 dblp:conf/focs/Berkholz12 fatcat:pjffmiqs5zdb5fesczrtogspgm