Automating Cutting Planes is NP-Hard

by   Mika Göös, et al.

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, 1) It is NP-hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and 2)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üller (FOCS 2019) that established an analogous result for Resolution. Our proofs rely on two new lifting theorems: (1) Dag-like lifting for gadgets with many output bits. (2) Tree-like lifting that simulates an r-round protocol with gadgets of query complexity O(log r) independent of input length.


page 1

page 2

page 3

page 4


Automating Resolution is NP-Hard

We show that the problem of finding a Resolution refutation that is at m...

On the Complexity of Branching Proofs

We consider the task of proving integer infeasibility of a bounded conve...

Complexity of cutting planes and branch-and-bound in mixed-integer optimization

We investigate the theoretical complexity of branch-and-bound (BB) and c...

Optimally cutting a surface into a disk

We consider the problem of cutting a set of edges on a polyhedral manifo...

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland

Consider the following two fundamental open problems in complexity theor...

Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization

Circuit-augmentation algorithms are a generalization of the Simplex meth...

Some New Methods to Generate Short Addition Chains

Modular exponentiation and scalar multiplication are important operation...