"Random Θ(log n)-CNFs Are Hard for Cutting Planes."

Noah Fleming et al. (2017)

Details and statistics

DOI: 10.1109/FOCS.2017.19

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics