Algorithm for k-SAT Based on Local Search Evgeny Dantsin Andreas Goerdt...  Home/Search
Context
Related
| berkeley.edu/~christos/sat.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~christos/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Local search is widely used for solving the propositional satis ability problem. Papadimitriou [16] showed that randomized local search solves 2-SAT in polynomial time. Recently, Schoning [20] proved that a close algorithm for k-SAT takes time (2 k ) up to a polynomial factor. This is the best known worst-case upper bound for randomized 3-SAT algorithms (cf. also [21]). (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ sat-deterministic,
author = "Algorithm For Sat",
title = "A Deterministic",
url = "citeseer.ist.psu.edu/763327.html" }
Citations (may not include all citations):318 Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1997
63 Information Theory (context) - Ash - 1965
35 New worst-case upper bounds for SAT - Hirsch - 2000
35 New methods for 3-SAT decision and worst-case analysis - Kullmann - 1999
28 Deciding propositional tautologies: Algorithms and their com.. - Kullmann, Luckhardt - 1997
27 Minimizing con icts: a heuristic repair method for constrain.. (context) - Minton, Johnston et al. - 1992
15 SAT decision and lower bounds: approaches for improved SAT a.. (context) - Kullmann - 1996
12 SAT local search algorithms: Worst-case study - Hirsch - 2000
8 volume 54 of Mathematical Library (context) - Cohen, Honkala et al. - 1997
8 the greedy algorithm for satis ability (context) - Koutsoupias, Papadimitriou - 1992
7 Two propositional proof systems based on the splitting metho.. (context) - Dantsin - 1981
6 Average time complexity of the sat1:2 algorithm (context) - Gu, Gu - 1994
4 Search Methods for Arti cial Intelligence (context) - Bolc, Cytowski - 1992
3 Cambridge Tracts in Theoretical Computer Science (context) - Gu, Purdom et al. - 2000
1 Solving satis ability in less then (context) - Monien, Speckenmeyer
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.berkeley.edu/~christos/): More
Computational Aspects of Organization Theory (Extended.. - Papadimitriou, al. (Correct)
A Microeconomic View of Data Mining - Kleinberg, Papadimitriou, Raghavan (1998) (Correct)
NP-completeness: A Retrospective - Papadimitriou (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC