{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:48:26Z","timestamp":1725853706259},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_211","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:48:01Z","timestamp":1553100481000},"page":"678-680","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Algorithms for k SAT Based on Local Search"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"122_CR5295","doi-asserted-by":"crossref","unstructured":"Baumer S, Schuler R (2003) Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. ECCC TR03-010. Also presented at SAT","DOI":"10.1007\/978-3-540-24605-3_12"},{"issue":"1","key":"122_CR5296","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E Dantsin","year":"2002","unstructured":"Dantsin E, Goerdt A, Hirsch EA, Kannan R, Kleinberg J, Papadimitriou C, Raghavan P, Sch\u00f6ning U (2002) A deterministic ( 2 \u2212 2 \u2215 ( k + 1 ) ) n $$(2 - 2\/(k + 1))^{n}$$ algorithm for k-SAT based on local search. Theor Comput Sci 289(1):69\u201383","journal-title":"Theor Comput Sci"},{"key":"122_CR5297","doi-asserted-by":"crossref","unstructured":"Hofmeister T, Sch\u00f6ning U, Schuler R, Watanabe O (2002) Probabilistic 3-SAT algorithm further improved. In: Proceedings 19th symposium on theoretical aspects of computer science, Juan-les-Pins. LNCS, vol\u00a02285, pp\u00a0193\u2013202","DOI":"10.1007\/3-540-45841-7_15"},{"key":"122_CR5298","unstructured":"Iwama K, Tamaki S (2004) Improved upper bounds for 3-SA T. In: Proceedings 15th annual ACM-SIAM symposium on discrete algorithms, New Orleans, pp\u00a0321\u2013322"},{"key":"122_CR5299","doi-asserted-by":"crossref","unstructured":"Kautz H, Selman B (2003) Ten challenges redux: recent progress in propositional reasoning and search. In: Proceedings 9th international conference on principles and practice of constraint programming, Kinsale, pp\u00a01\u201318","DOI":"10.1007\/978-3-540-45193-8_1"},{"key":"122_CR5300","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","volume":"10","author":"B Monien","year":"1985","unstructured":"Monien B, Speckenmeyer E (1985) Solving satisfiability in less than 2 n steps. Discret Appl Math 10:287\u2013295","journal-title":"Discret Appl Math"},{"key":"122_CR5301","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH (1991) On selecting a satisfying truth assignment. In: Proceedings 32nd annual symposium on foundations of computer science, San Juan, pp\u00a0163\u2013169","DOI":"10.1109\/SFCS.1991.185365"},{"key":"122_CR5302","doi-asserted-by":"crossref","unstructured":"Paturi R, Pudl\u00e1k P, Saks ME, Zane F (1998) An improved exponential-time algorithm for k-SAT. In: Proceedings 39th annual symposium on foundations of computer science, Palo Alto, pp\u00a0628\u2013637; J ACM 52(3):337\u2013364 (2006)","DOI":"10.1109\/SFCS.1998.743513"},{"key":"122_CR5303","unstructured":"Rolf D (2003) 3-SAT\u2009\u2208\u2009RTIME(O(1.\u200932793 n )). ECCC TR03-054"},{"key":"122_CR5304","first-page":"111","volume":"1","author":"D Rolf","year":"2006","unstructured":"Rolf D (2006) Improved bound for the PPSZ\/Sch\u00f6ning-algorithm for 3-SAT. J Satisf Boolean Model Comput 1:111\u2013122","journal-title":"J Satisf Boolean Model Comput"},{"key":"122_CR5305","doi-asserted-by":"crossref","unstructured":"Sch\u00f6ning U (1999) A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings 40th annual symposium on foundations of computer science, New York, pp\u00a0410\u2013414","DOI":"10.1109\/SFFCS.1999.814612"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T19:04:17Z","timestamp":1574363057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_211","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}