The following pages link to Oliver Kullmann (Q391123):
Displaying 30 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems (Q1430293) (← links)
- Minimal unsatisfiability and minimal strongly connected digraphs (Q1656590) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- On computing the union of MUSes (Q2181933) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- (Q2741528) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency (Q2895792) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
- Unified Characterisations of Resolution Hardness Measures (Q3192062) (← links)
- (Q3429157) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (Q3612474) (← links)
- (Q4375761) (← links)
- The Seventh QBF Solvers Evaluation (QBFEVAL’10) (Q4930592) (← links)
- Green-Tao Numbers and SAT (Q4930604) (← links)
- Theory and Applications of Satisfiability Testing (Q5325880) (← links)
- On SAT Representations of XOR Constraints (Q5404931) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- Theory and Applications of Satisfiability Testing (Q5714776) (← links)
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (Q5756578) (← links)
- Transforming quantified Boolean formulas using biclique covers (Q6536143) (← links)
