Random Θ(log n)-CNFs are Hard for Cutting Planes.
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere.
FOCS 2017. [ECCC]
J. ACM 69(3) (2022)
McGill University / Computer Science
Associate Professor · Computational Complexity · Proof Complexity
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere.
FOCS 2017. [ECCC]
J. ACM 69(3) (2022)