{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:47:51Z","timestamp":1725853671677},"publisher-location":"New York, NY","reference-count":12,"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_45","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:09:45Z","timestamp":1553098185000},"page":"170-174","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Backtracking Based k-SAT Algorithms"],"prefix":"10.1007","author":[{"given":"Ramamohan","family":"Paturi","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Pudl\u00e1k","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[]},{"given":"Francis","family":"Zane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"781_CR216","series-title":"SAT, Santa Margherita Ligure","first-page":"150","volume-title":"Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs","author":"S Baumer","year":"2003","unstructured":"Baumer S, Schuler R (2003) Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. In: SAT, Santa Margherita Ligure, pp\u00a0150\u2013161"},{"key":"781_CR217","volume-title":"The complexity of unique k-SAT: an isolation lemma for k-CNFs","author":"C Calabro","year":"2003","unstructured":"Calabro C, Impagliazzo R, Kabanets V, Paturi R (2003) The complexity of unique k-SAT: an isolation lemma for k-CNFs. In: Proceedings of the eighteenth IEEE conference on computational complexity, Aarhus"},{"issue":"1","key":"781_CR218","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 k + 1 ) n $$(2 - \\frac{2} {k+1})^{n}$$ algorithm for k-SAT based on local search. Theor Comp Sci 289(1):69\u201383","journal-title":"Theor Comp Sci"},{"key":"781_CR219","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland D (1962) A machine program for theorem proving. Commun ACM 5:394\u2013397","journal-title":"Commun ACM"},{"key":"781_CR220","doi-asserted-by":"crossref","unstructured":"Hofmeister T, Sch\u00f6ning U, Schuler R, Watanabe O (2002) A probabilistic 3-SAT algorithm further improved. In: STACS, Antibes Juan-les-Pins. LNCS, vol 2285, Springer, Berlin, pp\u00a0192\u2013202","DOI":"10.1007\/3-540-45841-7_15"},{"key":"781_CR221","first-page":"328","volume-title":"Improved upper bounds for 3-SAT","author":"K Iwama","year":"2004","unstructured":"Iwama K, Tamaki S (2004) Improved upper bounds for 3-SAT. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, New Orleans, pp\u00a0328\u2013329"},{"issue":"1\u20132","key":"781_CR222","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","volume":"223","author":"O Kullmann","year":"1999","unstructured":"Kullmann O (1999) New methods for 3-SAT decision and worst-case analysis. Theor Comp Sci 223(1\u20132):1\u201372","journal-title":"Theor Comp Sci"},{"key":"781_CR223","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":"781_CR224","doi-asserted-by":"crossref","unstructured":"Paturi R, Pudl\u00e1k P, Saks M, Zane F (2005) An improved exponential-time algorithm for k-SAT. J ACM 52(3):337\u2013364. (An earlier version presented in Proceedings of the 39th annual IEEE symposium on foundations of computer science, 1998, pp\u00a0628\u2013637)","DOI":"10.1145\/1066100.1066101"},{"key":"781_CR225","unstructured":"Paturi R, Pudl\u00e1k P, Zane F (1999) Satisfiability Coding Lemma. In: Proceedings of the 38th annual IEEE symposium on foundations of computer science, Miami Beach, 1997, pp.\u00a0566\u2013574. Chicago J Theor Comput Sci. http:\/\/cjtcs.cs.uchicago.edu\/"},{"key":"781_CR226","unstructured":"Rolf D (2003) 3-SAT \u2208 RTIME (1. 32971 n ). In: ECCC TR03-054"},{"key":"781_CR227","doi-asserted-by":"crossref","unstructured":"Sch\u00f6ning U (2002) A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32:615\u2013623. (An earlier version appeared in 40th annual symposium on foundations of computer science (FOCS \u201999), pp\u00a0410\u2013414)","DOI":"10.1007\/s00453-001-0094-7"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T19:02:58Z","timestamp":1574362978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_45","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"}}]}}