collaborators

1 paper

cs.CC2020

Automating Cutting Planes is NP-Hard}

Mika Göös, Sajin Koroth, Ian Mertz +1

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula , 1) It is NP-hard to find a CP refutation of in time polynomial in the length of th…