Scheder, Dominik ; Zumstein, PhilippORCID: 0000-0002-6485-9434How many conflicts does it need to be unsatisfiable?Kleine Büning, Hans
Lecture Notes in Computer Science
4996
246-256
In: Theory and Applications of Satisfiability Testing - SAT 2008 : 11th International Conference, SAT 2008, Guangzhou, China, May 12 - 15, 2008; proceedings
(2008)
Berlin [u.a.]
SAT 2008 - 11th International Conference on Theory and Applications of Satisfiability Testing
(Guangzhou, China)
[Konferenzveröffentlichung]
Vorschau
Scheder, Dominik ; Zumstein, PhilippORCID: 0000-0002-6485-9434Satisfiability with exponential families.Marques-Silva, João
Lecture Notes in Computer Science
4501
148-158
In: Theory and applications of satisfiability testing - SAT 2007 : 10th International Conference, Lisbon, Portugal, May 28 - 31, 2007; proceedings
(2007)
Berlin [u.a.]
SAT 2007 - 10th International Conference on Theory and Applications of Satisfiability Testing
(Lisbon, Portugal)
[Konferenzveröffentlichung]
Vorschau
Diese Liste wurde am Thu Nov 21 01:50:33 2024 CET automatisch erstellt.
