Oliver Kullmann

Citado por

	Total	Desde 2018
Citas	2705	866
Índice h	25	12
Índice i10	51	14

220

110

165

1997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220237 25 32 50 29 44 82 63 104 95 97 106 76 67 138 81 163 191 75 125 147 134 133 140 202 115 142

Acceso público

Ver todo

7 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Marijn HeuleAssociate Professor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Matthew GwynneSwansea UniversityDirección de correo verificada de swan.ac.uk
Armin BiereProfessor of Computer Science, University of FreiburgDirección de correo verificada de informatik.uni-freiburg.de
Joao Marques-SilvaCNRS Research Director, IRIT, CNRS & ANITIDirección de correo verificada de irit.fr
Siert WieringaDirección de correo verificada de siert.nl
Ines LynceINESC-ID, Instituto Superior Técnico (IST), Universidade de LisboaDirección de correo verificada de tecnico.ulisboa.pt
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaDirección de correo verificada de szeider.net
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyDirección de correo verificada de uni-jena.de
Nicola GalesiSapienza University RomeDirección de correo verificada de uniroma1.it
Luca PulinaUniversity of SassariDirección de correo verificada de uniss.it
Armando TacchellaProfessor, Information Processing Systems, University of GenoaDirección de correo verificada de unige.it
Daniel Le BerreCRIL-CNRS Université d'ArtoisDirección de correo verificada de cril.fr
Laurent SimonProfessor of Computer Science, Bordeaux University, France (since 2013)Dirección de correo verificada de labri.fr
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverDirección de correo verificada de thi.uni-hannover.de

Seguir

Oliver Kullmann

Swansea University

Dirección de correo verificada de Swansea.ac.uk - Página principal

Satisfiability SAT Algorithms Computational Complexity Combinatorics


Título Ordenar por citas Ordenar por año Ordenar por 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	259	2016
New methods for 3-SAT decision and worst-case analysis O Kullmann Theoretical Computer Science 223 (1-2), 1-72, 1999	245	1999
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	202	2011
On a generalization of extended resolution O Kullmann Discrete Applied Mathematics 96, 149-176, 1999	167	1999
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	140	2002
Investigations on autark assignments O Kullmann Discrete Applied Mathematics 107 (1-3), 99-137, 2000	110	2000
An application of matroid theory to the SAT problem O Kullmann Proceedings 15th Annual IEEE Conference on Computational Complexity, 116-124, 2000	96	2000
Minimal Unsatisfiability and Autarkies. HK Büning, O Kullmann Handbook of Satisfiability 185, 339-401, 2009	92	2009
The science of brute force MJH Heule, O Kullmann Communications of the ACM 60 (8), 70-79, 2017	86	2017
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets O Kullmann Discrete Applied Mathematics 130 (2), 209-249, 2003	72	2003
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	63	1999
Deciding propositional tautologies: Algorithms and their complexity O Kullmann, H Luckhardt preprint 82, 1997	60	1997
Fundaments of Branching Heuristics. O Kullmann Handbook of Satisfiability 185, 205-244, 2009	57	2009
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	57	2006
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	54	2004
Investigating the behaviour of a SAT solver on random formulas O Kullmann Technical report Swansea University CSR 23-2002, 119, 2002	51	2002
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	46	2010
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	43	1996
On the van der Waerden numbers w (2; 3, t) T Ahmed, O Kullmann, H Snevily Discrete Applied Mathematics 174, 27-51, 2014	38	2014
Algorithms for SAT/TAUT decision based on various measures O Kullmann, H Luckhardt Preprint 71, 1998	35	1998

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores