Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs.

Gbor Kusper, Tams Balla, Csaba Bir, Tibor Tajti, Zijian Gyozo Yang, Imre Bajk

Browse the full SYNASC paper archive.