Ján Pich, Rahul Santhanam. Why are Proof Complexity Lower Bounds Hard?. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 1305-1324, IEEE Computer Society, 2019. [doi]
Abstract is missing.