| |
| 2008 | ||
|---|---|---|
| 7 | EE | Dominik Scheder: Guided Search and a Faster Deterministic Algorithm for 3-SAT. LATIN 2008: 60-71 |
| 6 | EE | Dominik Scheder, Philipp Zumstein: How Many Conflicts Does It Need to Be Unsatisfiable?. SAT 2008: 246-256 |
| 5 | EE | Dominik Scheder, Philipp Zumstein: An Improved Bound on the Number of Con flicts in Unsatisfiable k-CNF Formulas CoRR abs/0806.1148: (2008) |
| 4 | EE | Dominik Scheder: Satisfiability of Almost Disjoint CNF Formulas CoRR abs/0807.1282: (2008) |
| 2007 | ||
| 3 | EE | Dominik Scheder, Philipp Zumstein: Satisfiability with Exponential Families. SAT 2007: 148-158 |
| 2 | EE | Dominik Scheder: Unsatisfiable Linear k-CNFs Exist, for every k CoRR abs/0708.2336: (2007) |
| 1 | EE | Claudia Käppeli, Dominik Scheder: Partial Satisfaction of k-Satisfiable Formulas. Electronic Notes in Discrete Mathematics 29: 497-501 (2007) |
| 1 | Claudia Käppeli | [1] |
| 2 | Philipp Zumstein | [3] [5] [6] |