{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:15Z","timestamp":1720640835853},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1571-0653(04)00463-9","type":"journal-article","created":{"date-parts":[[2004,10,24]],"date-time":"2004-10-24T03:07:12Z","timestamp":1098587232000},"page":"71-79","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["An efficient local search method for random 3-satisfiability"],"prefix":"10.1016","volume":"16","author":[{"given":"Sakari","family":"Seitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pekka","family":"Orponen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB2","first-page":"561","article-title":"On the complexity of unsatisfiability proofs for random k-CNF formulas","author":"Beame","year":"1998","journal-title":"Proc. 30th ACM STOC"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB3","doi-asserted-by":"crossref","unstructured":"W. Barthel, A. K. Hartmann and M. Weigt, Solving satisfiability problems by fluctuations: the dynamics of stochatic local search algorithms, Preprint arXiv:cond-mat\/0301271 (2003).","DOI":"10.1103\/PhysRevE.67.066104"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB4","unstructured":"A. Braunstein, M. M\u00e9zard and R. Zecchina, Survey propagation: an algorithm for satisfiability, Preprint arXiv:cs.CC\/0212002 (2002)."},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB5","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","article-title":"Many hard examples for resolution","volume":"35","author":"Chv\u00e1tal","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","article-title":"Experimental results on the crossover point in random 3SAT","volume":"81","author":"Crawford","year":"1996","journal-title":"Artif. Intell"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB7","first-page":"124","article-title":"Typical random 3-SAT formulae and the satisfiability threshold","author":"Dubois","year":"2000","journal-title":"Proc. 11th ACM\u2013SIAM SODA"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics: the great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"J. Comp. Phys"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB9","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","article-title":"Sharp thresholds of graph properties, and the k-SAT problem","volume":"12","author":"Friedgut","year":"1999","journal-title":"J. Amer. Math. Soc"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB10","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB11","first-page":"289","article-title":"Systematic vs. local search for SAT","volume":"1701","author":"Hoos","year":"1999","journal-title":"Proc. KI-99, Springer LNAI"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB12","first-page":"574","article-title":"The probabilistic analysis of a greedy satisfiability algorithm","volume":"2461","author":"Kaporis","year":"2002","journal-title":"Proc. 10th ESA, Springer LNCS"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(93)90003-7","article-title":"On the depth of combinatorial optimization problems","volume":"43","author":"Kern","year":"1993","journal-title":"Discr. Appl. Math"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB15","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of random Boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB16","unstructured":"D. McAllester, B. Selman and H. Kautz, Evidence for invariants in local search, Proc. AAAI-97 (1997)."},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB17","series-title":"Spin Glass Theory and Beyond","author":"M\u00e9zard","year":"1987"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB18","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1126\/science.1073287","article-title":"Analytic and algorithmic solution of random satisfiability problems","volume":"297","author":"M\u00e9zard","year":"2002","journal-title":"Science"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.66.056126","article-title":"Random K-satisfiability problem: from an analytic solution to an efficient algorithm","volume":"66","author":"M\u00e9zard","year":"2002","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB20","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992","journal-title":"Proc. AAAI-92"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","article-title":"Determining computational complexity from characteristic \u2018phase transitions\u2019","volume":"400","author":"Monasson","year":"1999","journal-title":"Nature"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB22","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.89.268701","article-title":"Coloring random graphs","volume":"89","author":"Mulet","year":"2002","journal-title":"Phys. Rev. Lett"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB23","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/BF01237484","article-title":"Computer search for small caps","volume":"69","author":"\u00d6sterg\u00e5rd","year":"2000","journal-title":"J. Geom"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB24","first-page":"163","article-title":"On selecting a satisfying truth assignment","author":"Papadimitriou","year":"1991","journal-title":"Proc. 32nd IEEE FOCS"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S0036144501395952","article-title":"Combinatorial landscapes","volume":"44","author":"Reidys","year":"2002","journal-title":"SIAM Review"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB26","unstructured":"Source code for the WalkSAT algorithm: http:\/\/www.satlib.org\/"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB27","first-page":"410","article-title":"A probabilistic algorithm for k-SAT and constraint satisfaction problems","author":"Sch\u00f6ning","year":"1999","journal-title":"Proc. 40th IEEE FOCS"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB28","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1090\/dimacs\/026\/25","article-title":"Local search strategies for satisfiability testing","volume":"26","author":"Selman","year":"1996","journal-title":"DIMACS Series in Discr. Math. and Theor. Comp. Sc"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB29","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.67.066103","article-title":"Relaxation and metastability in the random WalkSAT search procedure","volume":"67","author":"Semerjian","year":"2003","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB30","unstructured":"Source code for the survey propagation algorithm: http:\/\/www.ictp.trieste.it\/~zecchina\/SP\/"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB31","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.1103\/PhysRevE.59.3983","article-title":"Relaxation in graph coloring and satisfiability problems","volume":"59","author":"Svenson","year":"1999","journal-title":"Phys. Rev. E"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB32","series-title":"Complexity Theory Retrospective II","first-page":"295","article-title":"Average-case computational complexity theory","author":"Wang","year":"1997"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB33","first-page":"216","article-title":"Accelerating random walks","volume":"2470","author":"Wei","year":"2002","journal-title":"Proc. CP-2002, Springer LNCS"},{"key":"10.1016\/S1571-0653(04)00463-9_NEWBIB34","series-title":"Proc. 13th NIPS","first-page":"689","article-title":"Generalized belief propagation","author":"Yedidia","year":"2001"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004639?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004639?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T21:57:08Z","timestamp":1549144628000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":34,"alternative-id":["S1571065304004639"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00463-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}