{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:53Z","timestamp":1759637753741},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_13","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"141-151","source":"Crossref","is-referenced-by-count":17,"title":["Algorithms for SAT Based on Search in Hamming Balls"],"prefix":"10.1007","author":[{"given":"Evgeny","family":"Dantsin","sequence":"first","affiliation":[]},{"given":"Edward A.","family":"Hirsch","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolpert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Baumer, S., Schuler, R.: Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. Electronic Colloquium on Computational Complexity, Report No. 10 (February 2003)","DOI":"10.1007\/978-3-540-24605-3_12"},{"key":"13_CR2","series-title":"Mathematical Library","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Mathematical Library, vol.\u00a054. Elsevier, Amsterdam (1997)"},{"issue":"1","key":"13_CR3","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, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Sch\u00f6ning, U.: A deterministic (2 \u2013 $\\frac{2}{k+1}$ )n algorithm for k-SAT based on local search. Theoretical Computer Science\u00a0289(1), 69\u201383 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Sch\u00f6ning, U.: Deterministic algorithms for k-SAT based on covering codes and local search. In: Montanari, Rolim, Welzl (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 236\u2013247 (2000)","DOI":"10.1007\/3-540-45022-X_21"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1023\/A:1006340920104","volume":"24","author":"E.A. Hirsch","year":"2000","unstructured":"Hirsch, E.A.: New worst-case upper bounds for SAT. Journal of Automated Reasoning\u00a024(4), 397\u2013420 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-45841-7_15","volume-title":"STACS 2002","author":"T. Hofmeister","year":"2002","unstructured":"Hofmeister, T., Sch\u00f6ning, U., Schuler, R., Watanabe, O.: A probabilistic 3- SAT algorithm further improved. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 192\u2013202. Springer, Heidelberg (2002)"},{"key":"13_CR7","unstructured":"Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. Electronic Colloquium on Computational Complexity, Report No. 53 (July 2003)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Paturi, R., Pudl\u00e1k, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-SAT. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 628\u2013637 (1998)","DOI":"10.1109\/SFCS.1998.743513"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Paturi, R., Pudl\u00e1k, P., Zane, F.: Satisfiability coding lemma. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1997, pp. 566\u2013574 (1997)","DOI":"10.1109\/SFCS.1997.646146"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BFb0055762","volume-title":"Mathematical Foundations of Computer Science 1998","author":"P. Pudl\u00e1k","year":"1998","unstructured":"Pudl\u00e1k, P.: Satisfiability \u2014 algorithms and logic. In: Brim, L., Gruska, J., Zlatuska, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 129\u2013141. Springer, Heidelberg (1998)"},{"key":"13_CR11","unstructured":"Rolf, D.: 3-SAT in RTIME(O(1.32793n)) \u2014 improving randomized local search by initializing strings of 3-clauses. Electronic Colloquium on Computational Complexity, Report No. 54 (July 2003)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1999, pp. 410\u2013414 (1999)","DOI":"10.1109\/SFFCS.1999.814612"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00453-001-0094-7","volume":"32","author":"U. Sch\u00f6ning","year":"2002","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica\u00a032(4), 615\u2013623 (2002)","journal-title":"Algorithmica"},{"key":"13_CR14","unstructured":"Schuler, R.: An algorithm for the satisfiability problem of formulas in conjunctive normal form (2003) (manuscript)"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T01:33:25Z","timestamp":1559612005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}