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

Dmitry Sokolov (2023)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2023-06-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics