Automating Cutting Planes is NP-Hard

Automating Cutting Planes is NP-Hard

Explore the complexity of automating cutting planes in this 25-minute conference talk presented at an Association for Computing Machinery (ACM) event. Delve into the history of cutting planes and their significance in optimization theory. Examine the algorithmic problem at hand and understand the intricacies of proof systems related to cutting planes. Follow the speaker's reduction and transformation techniques, leading to a theorem that demonstrates the NP-hardness of automating cutting planes. Gain insights into the implications of this result for computational complexity theory and optimization algorithms.