Automating Cutting Planes is NP-Hard}

STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing Chicago IL USA June, 2020, pp. 68-77, 2020.

Cited by: 0|Bibtex|Views58|DOI:https://doi.org/10.1145/3357713.3384248
EI
Other Links: arxiv.org|dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

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 ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments