Search the dblp DataBase

Publications of Author

1. Dominik Scheder, Philipp Zumstein
   Satisfiability with Exponential Families. [Citation Graph (0, 0)][DBLP]
   SAT, 2007, pp:148-158 [Conf]
   
2. Dominik Scheder
   Unsatisfiable Linear k-CNFs Exist, for every k [Citation Graph (0, 0)][DBLP]
   CoRR, 2007, v:0, n:, pp:- [Journal]
   
3. 
   The Lovász Local Lemma and Satisfiability. [Citation Graph (, )][DBLP]
   
   
4. 
   Guided Search and a Faster Deterministic Algorithm for 3-SAT. [Citation Graph (, )][DBLP]
   
   
5. 
   How Many Conflicts Does It Need to Be Unsatisfiable?. [Citation Graph (, )][DBLP]
   
   
6. 
   Unsatisfiable Linear CNF Formulas Are Large and Complex. [Citation Graph (, )][DBLP]
   
   
7. 
   An Improved Bound on the Number of Con flicts in Unsatisfiable k-CNF Formulas [Citation Graph (, )][DBLP]
   
   
8. 
   Satisfiability of Almost Disjoint CNF Formulas [Citation Graph (, )][DBLP]
   
   
9. 
   Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely [Citation Graph (, )][DBLP]
   
   
10. 
    Using a Skewed Hamming Distance to Speed Up Deterministic Local Search [Citation Graph (, )][DBLP]
    
    
11. 
    Using CSP To Improve Deterministic 3-SAT [Citation Graph (, )][DBLP]
    
    
12. 
    A Full Derandomization of Schoening's k-SAT Algorithm [Citation Graph (, )][DBLP]