default search action
"Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs."
Gábor Kusper et al. (2020)
- Gábor Kusper, Tamás Balla, Csaba Biró, Tibor Tajti, Zijian Gyozo Yang, Imre Baják:
Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs. SYNASC 2020: 84-92
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.