"Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs."

Gábor Kusper et al. (2020)

Details and statistics

DOI: 10.1109/SYNASC51798.2020.00024

access: closed

type: Conference or Workshop Paper

metadata version: 2021-03-03

a service of  Schloss Dagstuhl - Leibniz Center for Informatics