{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:54:21Z","timestamp":1725854061622},"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_680","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T14:28:46Z","timestamp":1553092126000},"page":"2301-2304","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unique k-SAT and General k-SAT"],"prefix":"10.1007","author":[{"given":"Timon","family":"Hertli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"3","key":"450_CR2151","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.jcss.2007.06.015","volume":"74","author":"C Calabro","year":"2008","unstructured":"Calabro C, Impagliazzo R, Kabanets V, Paturi R (2008) The complexity of unique k-SAT: an isolation lemma for k-CNFs. J Comput Syst Sci 74(3):386\u2013393","journal-title":"J Comput Syst Sci"},{"key":"450_CR2152","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/FOCS.2011.22","volume-title":"2011 IEEE 52nd annual symposium on foundations of computer science\u2014FOCS 2011","author":"T Hertli","year":"2011","unstructured":"Hertli T (2011) 3-SAT faster and simpler\u2014unique-SAT bounds for PPSZ hold in general. In: 2011 IEEE 52nd annual symposium on foundations of computer science\u2014FOCS 2011, Palm Springs. IEEE Computer Society, Los Alamitos, pp\u00a0277\u2013284"},{"key":"450_CR2153","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. ACM, New York, pp\u00a0328\u2013329 (electronic)"},{"key":"450_CR2154","doi-asserted-by":"crossref","unstructured":"Kullmann O (1997) Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms. In: Satisfiability problem: theory and applications, Piscataway, 1996. DIMACS series in discrete mathematics and theoretical computer science, vol\u00a035. American Mathematical Society, Providence, pp\u00a0261\u2013313","DOI":"10.1090\/dimacs\/035\/06"},{"key":"450_CR2155","doi-asserted-by":"crossref","unstructured":"Makino K, Tamaki S, Yamamoto M (2011) Derandomizing HSSW algorithm for 3-SAT. In: Computing and combinatorics, Dallas. Lecture notes in computer science, vol\u00a06842. Springer, Heidelberg, pp\u00a01\u201312","DOI":"10.1007\/978-3-642-22685-4_1"},{"issue":"3","key":"450_CR2156","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(3):287\u2013295","journal-title":"Discret Appl Math"},{"key":"450_CR2157","first-page":"245","volume-title":"Proceedings of the 43rd annual ACM symposium on theory of computing","author":"RA Moser","year":"2011","unstructured":"Moser RA, Scheder D (2011) A full derandomization of Schoening\u2019s k-SAT algorithm. In: Proceedings of the 43rd annual ACM symposium on theory of computing, San Jose. ACM, pp\u00a0245\u2013252"},{"key":"450_CR2158","first-page":"19","volume":"11","author":"R Paturi","year":"1999","unstructured":"Paturi R, Pudl\u00e1k P, Zane F (1999) Satisfiability coding lemma. Chic J Theor Comput Sci Article 11, 19 (electronic)","journal-title":"Chic J Theor Comput Sci Article"},{"key":"450_CR2159","doi-asserted-by":"crossref","unstructured":"Paturi R, Pudl\u00e1k P, Saks ME, Zane F (2005) An improved exponential-time algorithm for k-SAT. J ACM 52(3):337\u2013364 (electronic)","DOI":"10.1145\/1066100.1066101"},{"key":"450_CR2160","doi-asserted-by":"crossref","unstructured":"Rolf D (2005) Derandomization of PPSZ for unique-k-SAT. In: Theory and applications of satisfiability testing, St\u00a0Andrews. Lecture notes in computer science, vol\u00a03569. Springer, Berlin, pp\u00a0216\u2013225","DOI":"10.1007\/11499107_16"},{"key":"450_CR2161","first-page":"410","volume-title":"Proceedings of the 40th annual symposium on foundations of computer science","author":"U Sch\u00f6ning","year":"1999","unstructured":"Sch\u00f6ning U (1999) A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th annual symposium on foundations of computer science, New York City. IEEE Computer Society, Los Alamitos, pp\u00a0410\u2013414"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T18:56:22Z","timestamp":1574362582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_680","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"}}]}}