@article{Gs2020AutomatingCP,
title={Automating cutting planes is NP-hard},
author={Mika G{\"o}{\"o}s and Sajin Koroth and Ian Mertz and T. Pitassi},
journal={Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing},
year={2020}
}

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, one cannot find a tree-like CP refutation of F in time polynomial in the length of the shortest such refutation. The first result extends the recent breakthrough of Atserias and M'uller (FOCS 2019) that established an analogous result for… Expand