{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:06Z","timestamp":1725483846542},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_50","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"708-713","source":"Crossref","is-referenced-by-count":7,"title":["Scaling Properties of Pure Random Walk on Random 3-SAT"],"prefix":"10.1007","author":[{"given":"Andrew J.","family":"Parkes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S. Kirkpatrick","year":"1994","unstructured":"Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random boolean expressions. Science 264 (1994) 1297\u20131301","journal-title":"Science"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"Friedgut, E.: Sharp thresholds of graph properties, and the k-SAT problem. Journal of the American Mathematical Society 12 (1999) 1017\u20131054","journal-title":"Journal of the American Mathematical Society"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Goerdt: A remark on random 2-SAT. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 96 (1999)","DOI":"10.1016\/S0166-218X(99)00034-7"},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","volume":"81","author":"J.M. Crawford","year":"1996","unstructured":"Crawford, J.M., Auton, L.D.: Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81 (1996) 31\u201357","journal-title":"Artificial Intelligence"},{"key":"50_CR5","unstructured":"Achlioptas, D., Sorkin, G.B.: Optimal myopic algorithms for random 3-SAT. In: IEEE Symposium on Foundations of Computer Science (FOCS 00). (2000) 590\u2013600"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.:Local search strategies for satisfiability testing. In Johnson, D. S., Trick, M. A., eds.: Cliques, Coloring and Satisfiability, American Mathematical Society (1996) 521\u2013531","DOI":"10.1090\/dimacs\/026\/25"},{"key":"50_CR7","unstructured":"Broder, A.Z., Frieze, A.M., Upfal, E.: On the satisability and maximum satisability of random 3-CNF formulas. In: Proc. 4th Ann. ACM-SIAM SODA. (1993) 322\u2013330"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1006318521185","volume":"24","author":"E. A. Hirsch","year":"2000","unstructured":"Hirsch, E. A.: SAT local search algorithms: Worst-case study. Journal of Automated Reasoning 24 (2000) 127\u2013143","journal-title":"Journal of Automated Reasoning"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: On selecting a satisfying truth assignment. In: Proc. IEEE symposium on Foundations of Computer Science. (1991) 163\u2013169","DOI":"10.1109\/SFCS.1991.185365"},{"key":"50_CR10","unstructured":"Parkes, A. J.: Easy predictions for the easy-hard-easy transition. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002). (2002)"},{"key":"50_CR11","unstructured":"Parkes, A. J., Walser, J.P.: Tuning Local Search for Satisfiability Testing. In: Proceedings of AAAI-96, Portland, OR (1996) 356\u2013362"},{"key":"50_CR12","unstructured":"Ben-Sasson, E.: Personal communication (2002)"},{"key":"50_CR13","unstructured":"Parkes, A. J.: Distributed local search, phase transitions, and polylog time. In: Proc. \u201cStochastic Search Algorithms\u201d workshop, IJCAI-01\u201d. (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:25:36Z","timestamp":1556411136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}