"Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes."

Noah Fleming et al. (2022)

Details and statistics

DOI: 10.1145/3486680

access: closed

type: Journal Article

metadata version: 2022-07-25

a service of  Schloss Dagstuhl - Leibniz Center for Informatics