"Random (log n)-CNF Are Hard for Cutting Planes (Again)."

Dmitry Sokolov (2024)

Details and statistics

DOI: 10.1145/3618260.3649636

access: closed

type: Conference or Workshop Paper

metadata version: 2024-06-18

a service of  Schloss Dagstuhl - Leibniz Center for Informatics