Random Θ(log n)-CNFs Are Hard for Cutting Planes

Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere. Random Θ(log n)-CNFs Are Hard for Cutting Planes. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 109-120, IEEE Computer Society, 2017. [doi]

Abstract

Abstract is missing.