Josh Singer, Ian P. Gent, Alan Smaill  Home/Search
Context
Related
| dcs.stand.ac.uk/~...apes212000.ps.gz 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: dcs.stand.ac.uk/~a...apesreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Random-2+p-SAT interpolates between the polynomial-time problem Random-2-SAT when p = 0 and the NP-complete problem Random3 -SAT when p = 1. At some value p = p 0 0:41, a dramatic change in the structural nature of instances is predicted by statistical mechanics methods. This is reected by a change in the typical cost scaling for a complete search method Tableau, seen experimentally. We show empirically the same change of of behaviour in the local search algorithm WSat/Novelty , a... (Update)
Similar documents (at the sentence level):
37.7%: Local Search on Random 2+p-SAT - Singer, Gent, Smaill (2000) (Correct)
10.8%: Why Solutions Can Be Hard to - Nd Featural Theory (Correct)
Active bibliography (related documents): More All
0.5: On The Ground State Structure Of P And NP-Complete Random.. - Gliozzi, Zecchina (1999) (Correct)
0.3: Persistent and Quasi-Persistent Lemmas - In Propositional Model (Correct)
0.3: Threshold Phenomena in NK Landscapes - Gao (2001) (Correct)
Similar documents based on text: More All
0.5: Backbone Fragility and the Local Search Cost Peak - Singer, Gent, al. (2000) (Correct)
0.4: Backbone Fragility Causes the Local Search Cost Peak - Singer, Gent, Smaill (1999) (Correct)
0.2: The Hardest Random SAT Problems - Gent, Walsh (1994) (Correct)
BibTeX entry: (Update)
@misc{ singer-experiments,
author = "Josh Singer and Ian P. Gent and Alan Smaill",
title = "Experiments with Local Search on Random 2+p-SAT",
url = "citeseer.ist.psu.edu/singer00experiments.html" }
Citations (may not include all citations):534 The Complexity of Theorem-Proving Procedures (context) - Cook - 1971
329 Where the Really Hard Problems Are - Cheeseman, Kanefsky et al. - 1991
197 Noise Strategies for Improving Local Search - Selman, Kautz et al. - 1994
123 A linear-time algorithm for testing the truth of certain qua.. (context) - Aspvall, Plass et al. - 1979
97 Experimental Results on the Crossover Point in Random 3SAT - Crawford, Auton - 1996
82 Evidence for Invariants in Local Search - McAllester, Selman et al. - 1997
79 Analysis of Two Simple Heuristics on a Random Instance of k-.. - Frieze, Suen - 1996
59 On selecting a satisfying truth assignment (context) - Papadimitriou - 1991
44 Stochastic Local Search - Methods (context) - Hoos - 1998
42 Local Search and the Number of Solutions - Clark, Frank et al. - 1996
39 Needed: An empirical science of algorithms - Hooker - 1994
31 the Run-time Behaviour of Stochastic Local Search Algorithms.. - Hoos - 1999
30 Clustering at the Phase Transition - Parkes - 1997
20 Backbone Fragility and the Local Search Cost Peak - Singer, Gent et al. - 2000
17 SAT: Relation of Typical-Case Complexity to the Nature of th.. (context) - Monasson, Zecchina et al. - 1999
16 The Scaling of Search Cost - Gent, MacIntyre et al. - 1997
5 Local Search on Random 2+p-SAT (context) - Singer, Gent et al. - 2000
4 Finding Hard Instances of the Satis ability Problem: A Surve.. (context) - Cook, Mitchell - 1997
4 Tuning Local Search for Satis ability Testing (context) - Parkes, Walser - 1996
3 A propositional theorem prover to solve planning and other p.. (context) - van Gelder, Okushi - 1999
2 Rigorous Results (context) - Achlioptas, Kirousis et al. - 1997
1 Evidence for a Satis ability Threshold for Random 3CNF Formu.. (context) - Larrabee, Tsuji - 1992
Documents on the same site (http://www.dcs.st-and.ac.uk/~apes/apesreports.html): More
Further Analysis of SBDS against SBDD - Petrie (2003) (Correct)
A Case Study of Constraint Programming for Configuration.. - McDonald, Prosser (2002) (Correct)
The Tractability of Global Constraints - Bessiere, Hebrard, Hnich, Walsh (2004) (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