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

Cached

Download Links

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

Documents Related by Co-Citation

88 An Improved Exponential-time Algorithm for k-SAT – Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane - 1998
138 A probabilistic algorithm for k-SAT and constraint satisfaction problems – Uwe Schöning, Universität Ulm, Abteilung Theoretische Informatik - 1999
64 Satisfiability Coding Lemma – Ramamohan Paturi, Pavel Pudlák, Francis Zane - 1997
35 New Worst-Case Upper Bounds for SAT – Edward A. Hirsch, Recently Kullmann - 2000
894 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
1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
21 Two new upper bounds for SAT – Edward A. Hirsch, O. Kullmann - 1998
534 A Machine Program for Theorem-Proving – M Davis, G Logemann, D Loveland - 1962
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
20 Obere Komplexitätsschranken für TAUT-Entscheidungen – Horst Luckhardt - 1984
23 Deterministic algorithms for k-SAT based on covering codes and local search – Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning - 2000
24 Faster exact solutions for hard problems: a parameterized point of view – J Alber, J Gramm, R Niedermeier - 2001
65 Parameterizing above guaranteed values: MaxSat and MaxCut – M Mahajan, V Raman - 1999
30 Solving 3-satisfiability in less than 1.579 n steps – Ingo Schiermeyer - 1993
55 Finding Maximum Independent Sets in Sparse and General Graphs – Richard Beigel - 1999
8 Two systems for proving tautologies, based on the split method – E Dantsin - 1983
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
70 Solving satisfiability in less than 2 n steps – B Monien, E Speckenmeyer - 1985