During the past three years there was a considerable growth in the number of algorithms solving MAX-SAT and MAX-2-SAT in worst-case time of the order c
|
426
|
Some optimal inapproximability results
– Hastad
- 1997
|
|
326
|
A machine program for theorem-proving
– Davis, Logemann, et al.
- 1962
|
|
295
|
Noise Strategies for Improving Local Search
– Selman, Kautz, et al.
- 1994
|
|
164
|
Using CSP look-back techniques to solve real-world SAT instances
– Bayardo, Schrag
- 1997
|
|
143
|
Evidence for Invariants in Local Search
– McAllester, Selman, et al.
- 1997
|
|
119
|
Towards an Understanding of Hill--Climbing Procedures for SAT
– Gent, Walsh
- 1993
|
|
112
|
A probabilistic algorithm for k-SAT and constraint satisfaction problems
– Schoning
- 1999
|
|
91
|
A 7/8-approximation algorithm for MAX 3SAT
– Karloff, Zwick
- 1997
|
|
86
|
Hardness of approximations
– Arora, Lund
- 1996
|
|
79
|
On selecting a satisfying truth assignment
– Papadimitriou
- 1991
|
|
77
|
An improved exponential-time algorithm for k-SAT
– Paturi, Pudlak, et al.
- 1998
|
|
64
|
A computing procedure for quanti theory
– Davis, Putnam
- 1960
|
|
64
|
Cha: Engineering an Ecient SAT Solver
– Moskewicz, Madigan, et al.
- 2001
|
|
62
|
On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
– Hoos
- 1999
|
|
55
|
A deterministic (2 − 2/(k + 1)) n algorithm for k-SAT based on local search
– Dantsin, Goerdt, et al.
- 2002
|
|
46
|
Local search algorithms for SAT: An empirical evaluation
– Hoos, Stutzle
- 2000
|
|
46
|
Parameterizing above guaranteed values: MaxSat and MaxCut
– Mahajan, Raman
- 1999
|
|
44
|
Unsatisfied Variables in Local Search
– Gent, Walsh
- 1995
|
|
38
|
Upper bounds for MaxSat: Further improved
– Bansal, Raman
- 1999
|
|
37
|
New worst-case upper bounds for SAT
– Hirsch
- 2000
|
|
31
|
Improved approximation algorithms for MAX SAT
– Asano, Williamson
- 2000
|
|
30
|
Approximate Solution of Weighted MAX-SAT Problems Using GRASP
– Resende, Pitsoulis, et al.
- 1997
|
|
25
|
Deterministic algorithms for k-SAT based on covering codes and local search
– Dantsin, Goerdt, et al.
- 2000
|
|
23
|
Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT
– Feige, Goemans
- 1995
|
|
22
|
Reactive Search, a History-Sensitive Heuristic for MAX-SAT
– Battiti, Protasi
- 1997
|
|
22
|
Finding almost-satisfying assignments
– Zwick
- 1998
|
|
19
|
Approximate Algorithms and Heuristics for MAX-SAT
– Battiti, Protasi
- 1998
|
|
18
|
Rossmanith: New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT
– Gramm, Hirsch, et al.
- 2000
|
|
17
|
Two propositional proof systems based on the splitting method (in Russian
– Dantsin
- 1981
|
|
15
|
Approximation algorithms for MAX SAT: a better performance ratio at the cost of a longer running time
– Dantsin, Gavrilovich, et al.
- 1998
|
|
15
|
SAT Local Search Algorithms: Worst-Case Study
– Hirsch
- 2000
|
|
14
|
Algorithms for satis (SAT) problem: A survey
– Gu, Purdom, et al.
- 1997
|
|
14
|
A general stochastic approach to solving problems with hard and soft constraints
– Kautz, Selman, et al.
- 1997
|
|
14
|
On the Approximation of Maximum Satis
– Yannakakis
- 1994
|
|
11
|
A new algorithm for MAX-2-SAT
– Hirsch
- 2000
|
|
10
|
Solving satis in less then 2 n steps. Discrete Applied Mathematics
– Monien, Speckenmeyer
- 1985
|
|
9
|
Faster exact solutions for Max2Sat
– Gramm, Niedermeier
- 2000
|
|
9
|
Algorithms for the Maximum Satis Problem
– Hansen, Jaumard
- 1990
|
|
8
|
3-satis is testable in O(1:62 r ) steps
– Monien, Speckenmeyer
- 1979
|
|
6
|
A 2 K=4 -time algorithm for MAX-2-SAT: Corrected version
– Hirsch
- 2000
|
|
3
|
New upper bounds for maximum satis
– Niedermeier, Rossmanith
- 2000
|
|
2
|
Solving boolean satis using local search guided by unit clause elimination
– Hirsch, Kojevnikov
- 2001
|
|
1
|
Tuning local search for satisability testing
– Parkes, Walser
- 1996
|
|
1
|
zCha. An implementation of the Cha solver. Available from http://www.ee.princeton.edu/~chaff/zchaff.html
– Zhang
|
|
1
|
Computer assisted proof of spherical volume inequalities
– Zwick
- 2001
|
|
