Search the dblp DataBase

Publications of Author

1. Oliver Kullmann
   An improved version of width restricted resolution. [Citation Graph (0, 0)][DBLP]
   AMAI, 2000, pp:- [Conf]
   
2. Oliver Kullmann
   An Application of Matroid Theory to the SAT Problem. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2000, pp:116-0 [Conf]
   
3. Oliver Kullmann
   The Combinatorics of Conflicts between Clauses. [Citation Graph (0, 0)][DBLP]
   SAT, 2003, pp:426-440 [Conf]
   
4. Oliver Kullmann, Inês Lynce, João Marques-Silva
   Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. [Citation Graph (0, 0)][DBLP]
   SAT, 2006, pp:22-35 [Conf]
   
5. Nicola Galesi, Oliver Kullmann
   Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. [Citation Graph (0, 0)][DBLP]
   SAT, 2004, pp:- [Conf]
   
6. Nicola Galesi, Oliver Kullmann
   Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. [Citation Graph (0, 0)][DBLP]
   SAT (Selected Papers, 2004, pp:89-104 [Conf]
   
7. Oliver Kullmann
   Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:303-352 [Journal]
   
8. Oliver Kullmann
   Investigations on autark assignments. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:99-137 [Journal]
   
9. Oliver Kullmann
   Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:130, n:2, pp:209-249 [Journal]
   
10. Oliver Kullmann
    On a Generalization of Extended Resolution. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:149-176 [Journal]
    
11. Oliver Kullmann
    An application of matroid theory to the SAT problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:18, pp:- [Journal]
    
12. Oliver Kullmann
    Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:41, pp:- [Journal]
    
13. Herbert Fleischner, Oliver Kullmann, Stefan Szeider
    Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:503-516 [Journal]
    
14. Oliver Kullmann
    New Methods for 3-SAT Decision and Worst-case Analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:223, n:1-2, pp:1-72 [Journal]
    
15. Oliver Kullmann
    Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:314-327 [Conf]
    
16. 
    Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. [Citation Graph (, )][DBLP]
    
    
17. 
    Present and Future of Practical SAT Solving. [Citation Graph (, )][DBLP]
    
    
18. 
    The Seventh QBF Solvers Evaluation (QBFEVAL'10). [Citation Graph (, )][DBLP]
    
    
19. 
    Green-Tao Numbers and SAT. [Citation Graph (, )][DBLP]
    
    
20. 
    Exact Ramsey Theory: Green-Tao numbers and SAT [Citation Graph (, )][DBLP]
    
    
21. 
    Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. [Citation Graph (, )][DBLP]