Arrow Research search
Back to STOC

STOC 2020

Automating cutting planes is NP-hard

Conference Paper Session 1B: Proof Complexity and Applications of Logics Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
338061186418218186