Seguir
Oliver Kullmann
Oliver Kullmann
Dirección de correo verificada de Swansea.ac.uk - Página principal
Título
Citado por
Citado por
Año
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
3212016
New methods for 3-SAT decision and worst-case analysis
O Kullmann
Theoretical Computer Science 223 (1-2), 1-72, 1999
2561999
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
2392011
On a generalization of extended resolution
O Kullmann
Discrete Applied Mathematics 96, 149-176, 1999
1771999
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
1432002
The science of brute force
MJH Heule, O Kullmann
Communications of the ACM 60 (8), 70-79, 2017
1202017
Investigations on autark assignments
O Kullmann
Discrete Applied Mathematics 107 (1-3), 99-137, 2000
1112000
Minimal unsatisfiability and autarkies
H Kleine Büning, O Kullmann
Handbook of Satisfiability, 339-401, 2009
982009
An application of matroid theory to the SAT problem
O Kullmann
Proceedings 15th Annual IEEE Conference on Computational Complexity, 116-124, 2000
972000
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
O Kullmann
Discrete Applied Mathematics 130 (2), 209-249, 2003
772003
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
671999
Deciding propositional tautologies: Algorithms and their complexity
O Kullmann, H Luckhardt
preprint 82, 1997
631997
Fundaments of branching heuristics
O Kullmann
Handbook of Satisfiability, 205-244, 2009
612009
Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel
O Kullmann, I Lynce, J Marques-Silva
Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006
572006
Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
O Kullmann
Annals of Mathematics and Artificial Intelligence 40, 303-352, 2004
552004
Investigating the behaviour of a SAT solver on random formulas
O Kullmann
Technical report Swansea University CSR 23-2002, 119, 2002
522002
Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms.
O Kullman
Satisfiability Problem: Theory and Applications 35, 261-313, 1996
461996
The seventh QBF solvers evaluation (QBFEVAL’10)
C Peschiera, L Pulina, A Tacchella, U Bubeck, O Kullmann, I Lynce
Theory and Applications of Satisfiability Testing–SAT 2010: 13th …, 2010
452010
On the van der Waerden numbers w (2; 3, t)
T Ahmed, O Kullmann, H Snevily
Discrete Applied Mathematics 174, 27-51, 2014
412014
Algorithms for SAT/TAUT decision based on various measures
O Kullmann, H Luckhardt
Preprint 71, 1998
361998
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20