Stephen A. Cook, David G. Mitchell  Home/Search
Context Related
| cs.utoronto.ca/~mitc...cookmitchell.ps dream.dai.ed.ac.uk/gro...satsurvey3.ps cornell.edu/home/sel...cookmitchell.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: cs.utoronto.ca/~mitchell/ (more) Homepages: S.Cook |
Rate this article:      (best)Comment on this article |
Abstract: . Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the problem of generating hard instances with solutions. (Update)
Context of citations to this paper: More
.... the performance of SAT solvers has been evaluated experimentally either in terms of randomly generated instances of SAT problems, e.g. [24, 25], or structured instances, such as the instances from the DIMACS set [21] or the SATPLAN set [22] Merits of either approach are...
Cited by: More
Using a Temporal Constraint Network for Business Process.. - Governatori (2006) (Correct)
Probabilistic Methods in Landscape Analysis: Phase.. - Gao, Culberson (Correct)
Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2003) (Correct)
Active bibliography (related documents): More All
0.9: Some Pitfalls for Experimenters with Random SAT - Mitchell, Levesque (1996) (Correct)
0.9: Improvements To Propositional Satisfiability Search Algorithms - Freeman (1995) (Correct)
0.8: Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1995) (Correct)
Similar documents based on text: More All
0.5: 2LR An Algorithm for Solving Satisfiability Instances - Torres-Jimenez.. (2001) (Correct)
0.0: Every Stationary Polyhedral Set in R^n is Area Minimizing under.. - Choe (Correct)
0.0: Quantitative Analysis of Signal Abnormalities in MR Imaging for .. - Van Leemput (2001) (Correct)
Related documents from co-citation: More All
14: Noise strategies for improving local search - Selman, Kautz et al. - 1994
11: A machine program for theoremproving (context) - Davis, Logemann et al. - 1962
9: Using CSP look-back techniques to solve real-world SAT instances - Bayardo, Schrag - 1997
BibTeX entry: (Update)
S. Cook and D. Mitchell. Finding hard instances of the satisfiability problem: A survey. Proceedings of the DIMACS Workshop on Satisfiability Problems, To Appear, 1997. http://citeseer.ist.psu.edu/cook97finding.html More
@incollection{ cook97finding,
author = "Stephen A. Cook and David G Mitchell",
title = "Finding Hard Instances of the Satisfiability Problem: {A} Survey",
booktitle = "Satisfiability Problem: Theory and Applications",
volume = "35",
publisher = "American Mathematical Society",
editor = "Du and Gu and Pardalos",
pages = "1--17",
year = "1997",
url = "citeseer.ist.psu.edu/cook97finding.html" }
Citations (may not include all citations):534 The complexity of theorem proving procedures (context) - Cook - 1971
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960 ACM DBLP
416 A new method for solving hard satisfiability problems - Selman, Levesque et al. - 1992 DBLP
390 A machine program for theorem-proving (context) - Davis, Logemann et al. - 1962 ACM DBLP
371 Optimization by simulated annealing: an experimental evaluat.. (context) - Johnson, Aragon et al. - 1991
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992 DBLP
291 Theoretical Computer Science (context) - Haken, of - 1985 ACM
197 Noise strategies for improving local search - Selman, Kautz et al. - 1994 ACM DBLP
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984
150 Computational Complexity (context) - Papadimitriou - 1994 ACM
143 the complexity of timetable and multi-commodity flow problem.. (context) - Even, Itai et al. - 1976
135 Solving large-scale constraint satisfaction and scheduling p.. (context) - Minton, Johnston et al. - 1990
123 A linear-time algorithm for testing the truth of certain qua.. (context) - Aspvall, Plass et al. - 1979 DBLP
121 Hard examples for resolution (context) - Urquhart - 1987 ACM DBLP
113 Test pattern generation using Boolean satisfiability - Larrabee - 1992
112 Average case complete problems (context) - Levin - 1986 ACM DBLP
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996 ACM
86 the complexity of derivation in propositional calculus (context) - Tseitin - 1970
80 Improvements to propositional satisfiability search algorith.. - Freeman - 1994 ACM
74 An empirical study of greedy local search for satisfiability.. - Selman, Kautz - 1993 DBLP
72 Many hard examples for resolution (context) - Chv'atal, Szemer'edi - 1988
70 Efficient local search for very large-scale satisfiability p.. (context) - Gu - 1992 ACM
65 Probabilistic analysis of the Davis Putnam procedure for sol.. (context) - Franco, Paull - 1983
64 Solving propositional satisfiability problems (context) - Jeroslow, Wang - 1990 DBLP
61 Directional Resolution: The Davis-Putnam Procedure - Dechter, Rish - 1994
57 Tail bounds for occupancy and the satisfiability threshold c.. - Kamath, Motwani et al. - 1994 ACM DBLP
56 Feasibly constructive proofs and the propositional calculus (context) - Cook - 1975
53 Probabilistic analysis of a generalization of the unit-claus.. (context) - Chao, Franco - 1990
51 the satisfiability and maximum satisfiability of random 3-CN.. (context) - Broder, Frieze et al. - 1993
49 SAT versus UNSAT (context) - Dubois, Andre et al. - 1993
49 Average case completeness - Gurevich - 1991 ACM DBLP
47 Approximating the unsatisfiability threshold of random formu.. - Kirousis, Kranakis et al. - 1996 ACM DBLP
43 Branch-and-cut solution of inference problems in proposition.. (context) - Hooker, Fedjki - 1990 DBLP
41 Using CSP look-back techniques to solve exceptionally hard S.. - Bayardo, Robert - 1996 DBLP
38 Pure Literal Look Ahead: An O (context) - Schiermeyer - 1996
38 Algorithms for testing the satisfiability of propositional f.. (context) - Gallo, Urbani - 1989 ACM DBLP
37 Computational experience with an interior point algorithm on.. (context) - Kamath, Karmarkar et al. - 1990 ACM DBLP
31 cutting plane solution of inference problems: some computati.. (context) - Hooker - 1988
31 Personal Communication (context) - Van Gelder
30 the greedy algorithm for satisfiability - Koutsoupias, Papadimitriou - 1992
30 and Complexity Theory (context) - Kraj, Arithmetic et al. - 1995
30 the theory of average case complexity (context) - Ben-David, Chor et al. - 1992
29 A threshold for unsatisfiability (context) - Goerdt - 1992 ACM DBLP
28 Extended Horn sets in propositional logic (context) - Chandru, Hooker - 1991 ACM DBLP
26 A PolynomialTime Algorithm for the N-Queens Problem - Sosic, Gu - 1990
25 Unsatisfied variables in local search - Gent, Walsh - 1995
25 the odds are on his side (context) - Chv'atal, Reed et al. - 1992
24 Simulated annealing for hard satisfiability problems - Spears - 1993
23 the complexity of regular resolution and the Davis-Putnam pr.. (context) - Galil - 1977
21 Evidence for a satisfiability threshold for random 3CNF form.. - Larrabee, Tsuji - 1992 ACM
20 Critical behavior in the computational cost of satisfiabilit.. (context) - Selman, Kirkpatrick - 1996 DBLP
20 Parallel algorithms and architectures for very fast search (context) - Gu - 1989
20 Renaming a set of clauses as a horn set (context) - Lewis - 1978 ACM DBLP
19 The hardest random SAT problems - Gent, Walsh - 1994 ACM DBLP
19 Lower bounds for resolution and cutting planes proofs and mo.. (context) - Pudl'ak
19 Pseudo-random number generation from oneway functions (context) - Impagliazzo, Levin et al. - 1989
17 CNF satisfiability test by counting and polynomial average t.. (context) - Iwama - 1989 ACM DBLP
16 instances of the satisfiability problem (context) - Aspvall, NR - 1980
14 the probabilistic performance of algorithms for the satisfia.. - Franco - 1986
13 On renamable horn and generalized horn functions (context) - Chandru, Coullard et al. - 1990 DBLP
12 Some pitfalls for experimenters with random SAT - Mitchell, Levesque - 1996 DBLP
12 GSAT versus Simulated Annealing - Beringer, Aschemann et al. - 1994 DBLP
11 A class of logic problems solvable by linear programming (context) - Conforti, Cornu'ejols - 1992
9 On finding solutions for extended Horn formulas - Schlipf, Annextein et al. - 1995 ACM DBLP
7 On average P vs. average NP (context) - Wang, Belanger - 1993 ACM DBLP
6 Courant Computer Science Report No (context) - Goldberg, complexity et al. - 1979
6 A survey of average time analyses of satisfiability algorith.. (context) - Purdom - 1990 ACM
5 Plateaus and plateau search in boolean satisfiability proble.. - Hampson, Kibler - 1993
4 Average Case Results for Satisfiability Algorithms Under the.. - Franco, Swamanithan
4 On average case complexity of SAT for symmetric distribution - Makowsky, Sharell - 1995 DBLP
3 Analysis of three simple heuristics on a random instance of .. (context) - Frieze, Suen - 1992
3 On selecting a satisfying truth assignment (context) - Papadimitriou - 1991
3 An average case analysis of a resolution principle algorithm.. (context) - Hu, Tang et al. - 1992 DBLP
2 The complexity of the resolution proofs for the random set o.. (context) - Fu - 1995
2 Local search for satisfiability problem (context) - Gu - 1993
1 Experimental results on the cross-over point in random 3-SAT (context) - Crawford, Auton - 1996
1 A simplified proof that regular resolution is exponential (context) - Ben-Ari - 1980
1 Number of solutions of satisfiability instances -- applicati.. (context) - Simon, Dubois - 1989
1 Solving satisfiability problems: An algorithm implementation.. (context) - Pretolani - 1993
1 Department of Computer Science (context) - Wegener, of et al. - 1987
1 Random instances of a graph coloring problem are hard (context) - Leonid, Levin - 1988 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utoronto.ca/~mitchell/):
Hard Problems for CSP Algorithms - Mitchell (1998) (Correct)
Some Random CSPs are Hard for Resolution - Mitchell (2000) (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