Automating cutting planes is NP-hard

DOI10.1145/3357713.3384248OpenAlexW3022506034MaRDI QIDQ5144898

Ian Mertz, Toniann Pitassi, Mika Göös, Sajin Koroth

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.08037

zbMATH Keywords

cutting planesproof complexitylifting theoremsautomatability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Optimal length cutting plane refutations of integer programs ⋮ Large clique is hard on average for resolution

This page was built for publication: Automating cutting planes is NP-hard