Oliver Kullmann
Title
Cited by
Cited by
Year
New methods for 3-SAT decision and worst-case analysis
O Kullmann
Theoretical Computer Science 223 (1), 1-72, 1999
2221999
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
MJH Heule, O Kullmann, S Wieringa, A Biere
HVC 2011 Haifa Verification Conference 2011 7261, 50-65, 2011
1392011
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
H Fleischner, O Kullmann, S Szeider
Theoretical Computer Science 289 (1), 503-516, 2002
1362002
On a generalization of extended resolution
O Kullmann
Discrete Applied Mathematics 96, 149-176, 1999
1361999
Solving and verifying the boolean pythagorean triples problem via cube-and-conquer
MJH Heule, O Kullmann, VW Marek
International Conference on Theory and Applications of Satisfiability …, 2016
1352016
Investigations on autark assignments
O Kullmann
Discrete Applied Mathematics 107 (1-3), 99-137, 2000
972000
An application of matroid theory to the SAT problem
O Kullmann
Proceedings 15th Annual IEEE Conference on Computational Complexity, 116-124, 2000
892000
Minimal Unsatisfiability and Autarkies.
HK Büning, O Kullmann
Handbook of Satisfiability 185, 339-401, 2009
832009
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
O Kullmann
Discrete Applied Mathematics 130 (2), 209-249, 2003
682003
Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel
O Kullmann, I Lynce, J Marques-Silva
International Conference on Theory and Applications of Satisfiability …, 2006
562006
Investigating a general hierarchy of polynomially decidable classes of CNF’s based on short tree-like resolution proofs
O Kullmann
Technical Report TR99-041, Electronic Colloquium on Computational Complexity …, 1999
551999
Deciding propositional tautologies: Algorithms and their complexity
O Kullmann, H Luckhardt
preprint 82, 1997
551997
Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
O Kullmann
Annals of Mathematics and Artificial Intelligence 40 (3-4), 303-352, 2004
502004
Fundaments of Branching Heuristics.
O Kullmann
Handbook of Satisfiability 185, 205-244, 2009
482009
Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms
O Kullmann
DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35 …, 1997
471997
Investigating the behaviour of a SAT solver on random formulas
O Kullmann
Technical report Swansea University CSR 23-2002, 119, 2002
452002
The seventh QBF solvers evaluation (QBFEVAL’10)
C Peschiera, L Pulina, A Tacchella, U Bubeck, O Kullmann, I Lynce
International Conference on Theory and Applications of Satisfiability …, 2010
442010
The science of brute force
MJH Heule, O Kullmann
Communications of the ACM 60 (8), 70-79, 2017
372017
The combinatorics of conflicts between clauses
O Kullmann
International Conference on Theory and Applications of Satisfiability …, 2003
362003
On the van der Waerden numbers w (2; 3, t)
T Ahmed, O Kullmann, H Snevily
Discrete Applied Mathematics 174, 27-51, 2014
332014
The system can't perform the operation now. Try again later.
Articles 1–20