{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:29Z","timestamp":1725533909534},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_26","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"265-275","source":"Crossref","is-referenced-by-count":3,"title":["A Theoretical Analysis of Search in GSAT"],"prefix":"10.1007","author":[{"given":"Evgeny S.","family":"Skvortsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Bulatov, A.A., Skvortsov, E.S.: Phase transition for local search on planted SAT. CoRR, abs\/0811.2546 (2008)"},{"key":"26_CR2","unstructured":"Feige, U., Vilenchik, D.: A local search algorithm for 3SAT. Technical report MCS04-07 of the Weizmann Institute (2004)"},{"key":"26_CR3","unstructured":"Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. In: SODA, pp. 357\u2013363 (2003)"},{"key":"26_CR4","unstructured":"Gent, I.: On the stupid algorithm for Satisfiability. Ian. Gent. APES Report APES-03-1998. APES Research Group (1998)"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.7","volume":"1","author":"I.P. Gent","year":"1993","unstructured":"Gent, I.P., Bridge, S., Walsh, T.: An empirical analysis of search in GSAT. Journal of Artificial Intelligence Research\u00a01, 47\u201359 (1993)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"26_CR6","unstructured":"Gent, I.P., Walsh, T.: The enigma of SAT hill-climbing procedures. Technical report, Department of AI, University of Edinburgh (1992)"},{"key":"26_CR7","unstructured":"Gent, I.P., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: AAAI, pp. 28\u201333 (1993)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum Satisfiability problem. Computing\u00a044, 279\u2013303 (1990)","journal-title":"Computing"},{"issue":"1-2","key":"26_CR9","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. J. Autom. Reason\u00a024(1-2), 127\u2013143 (2000)","journal-title":"J. Autom. Reason"},{"key":"26_CR10","volume-title":"Stochastic Local Search: Foundations & Applications","author":"H. Hoos","year":"2004","unstructured":"Hoos, H., Sttzle, T.: Stochastic Local Search: Foundations & Applications. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(92)90029-U","volume":"43","author":"E. Koutsoupias","year":"1992","unstructured":"Koutsoupias, E., Papadimitriou, C.: On the greedy algorithm for Satisfiability. Inf. Process. Lett.\u00a043(1), 53\u201355 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2003.01.005","volume":"166","author":"M. Mastrolilli","year":"2005","unstructured":"Mastrolilli, M., Gambardella, L.M.: Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? European Journal of Operational Research\u00a0166(1), 63\u201376 (2005)","journal-title":"European Journal of Operational Research"},{"key":"26_CR13","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: AAAI, pp. 440\u2013446 (1992)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:43:30Z","timestamp":1552092210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}