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

Cached

Download Links

by O. Kullmann
Venue:THEORETICAL COMPUTER SCIENCE
Citations:54 - 10 self

Documents Related by Co-Citation

72 An Improved Exponential-time Algorithm for k-SAT – Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane - 1998
120 A probabilistic algorithm for k-SAT and constraint satisfaction problems – Uwe Schöning, Universität Ulm, Abteilung Theoretische Informatik - 1999
58 Satisfiability Coding Lemma – Ramamohan Paturi, Pavel Pudlák, Francis Zane - 1997
33 New Worst-Case Upper Bounds for SAT – Edward A. Hirsch, Recently Kullmann - 2000
423 A machine program for theoremproving – Martin Davis, George Logemann, Donald Loveland - 1962
21 Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms – Oliver Kullmann
35 Deciding propositional tautologies: Algorithms and their complexity – O. Kullmann, H. Luckhardt - 1997
22 Deterministic algorithms for k-SAT based on covering codes and local search – Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning - 2000
16 Two new upper bounds for SAT – Edward A. Hirsch, O. Kullmann - 1998
16 Obere Komplexitatsschranken fur TAUT-Entscheidungen – H Luckhardt - 1984
35 3-coloring in time O(1.3446 n ): a no-MIS algorithm – R Beigel, D Eppstein - 1995
926 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
697 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
49 Parameterizing above guaranteed values: MaxSat and MaxCut – M Mahajan, V Raman - 1999
58 Solving satisfiability in less than 2 n steps – B Monien, E Speckenmeyer - 1985
28 Solving 3-satisfiability in less than 1.579 n steps – I Schiermeyer - 1993
1950 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
8 Heuristics for SAT algorithms: Searching for some foundations – Oliver Kullmann - 1998
6 Two systems for proving tautologies, based on the split method – E Dantsin - 1983