New methods for 3-SAT decision and worst-case analysis (1999)

Cached

Download Links

by O. Kullmann
Venue:THEORETICAL COMPUTER SCIENCE
Citations:64 - 12 self

Active Bibliography

11 Algorithms for SAT/TAUT decision based on various measures – O. Kullmann, H. Luckhardt - 1999
17 Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs – Oliver Kullmann - 1999
38 Deciding propositional tautologies: Algorithms and their complexity – O. Kullmann, H. Luckhardt - 1997
22 Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms – Oliver Kullmann
35 New Worst-Case Upper Bounds for SAT – Edward A. Hirsch, Recently Kullmann - 2000
2 Deciding satisfiability of formulas with K clauses in less than 2^{0.30897K} steps – Edward A. Hirsch - 1997
21 Two new upper bounds for SAT – Edward A. Hirsch, O. Kullmann - 1998
6 Algorithms for k-SAT based on covering codes – Evgeny Dantsin, Edward A. Hirsch - 2000
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction – unknown authors - 2000
47 Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction – David Eppstein - 2001
2 3-Coloring in Time – Richard Beigel - 2000
8 Heuristics for SAT algorithms: Searching for some foundations – Oliver Kullmann - 1998
161 Improvements To Propositional Satisfiability Search Algorithms – Jon William Freeman - 1995
6 A Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments – Edward A. Hirsch - 1998
51 Satisfiability Testing with More Reasoning and Less Guessing – Allen Van Gelder, Yumi K. Tsuji - 1995
14 The search for Satisfaction – Ian P. Gent, Toby Walsh - 1999
23 Deterministic algorithms for k-SAT based on covering codes and local search РEvgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Sch̦ning - 2000
38 On the Complexity of k-SAT – Russell Impagliazzo, Ramamohan Paturi - 2001
1 Separating Signs In The Propositional Satisfiability Problem – E. A. Hirsch - 1998