{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:39Z","timestamp":1725551139365},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294986"},{"type":"electronic","value":"9783540322450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11571155_2","type":"book-chapter","created":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T02:32:31Z","timestamp":1130725951000},"page":"14-25","source":"Crossref","is-referenced-by-count":0,"title":["Some Heuristic Analysis of Local Search Algorithms for SAT Problems"],"prefix":"10.1007","author":[{"given":"Osamu","family":"Watanabe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(01)00159-1","volume":"265","author":"D. Achlioptas","year":"2001","unstructured":"Achlioptas, D.: Lower bounds for random 3-SAT via differential equations. Theoret. Comput. Sci.\u00a0265, 159\u2013185 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Barthel, W., Hartmann, A., Weigt, M.: Solving satisfiability by fluctuations: The dynamics of stochastic local search algorithms. Physical Review E\u00a067(066104) (2003)","DOI":"10.1103\/PhysRevE.67.066104"},{"key":"2_CR3","unstructured":"Special Issue \u201cSAT-2000\u201d. J. of Automated Reasoning 24(1-2) (2000)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Semerjian, G., Monasson, R.: Relaxation and metastability in a local search procedure for the random satisfiability problem. Physical Review E\u00a067(066103) (2003)","DOI":"10.1103\/PhysRevE.67.066103"},{"issue":"6","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.: Expander codes. IEEE Trans. on Information Theory\u00a042(6), 1710\u20131719 (1996)","journal-title":"IEEE Trans. on Information Theory"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-39816-5_5","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"O. Watanabe","year":"2003","unstructured":"Watanabe, O., Sawai, T., Takahashi, H.: Analysis of a randomized local search algorithm for LDPCC decoding problem. In: Albrecht, A.A., Steinh\u00f6fel, K. (eds.) SAGA 2003. LNCS, vol.\u00a02827, pp. 50\u201360. Springer, Heidelberg (2003)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Watanabe, O.: Pseudo expectation: A tool for analyzing local search algorithms, Progress of Theoret. Physics Supplement\u00a0157, 338\u2013344 (2005) (A detail version is available: Research Report C-198, Dept. of Mathematical and Comput. Sci., Tokyo Inst. of Tech.)","DOI":"10.1143\/PTPS.157.338"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11571155_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:55:35Z","timestamp":1605624935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11571155_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294986","9783540322450"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11571155_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}