{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:39:09Z","timestamp":1757540349282},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540251767"},{"type":"electronic","value":"9783540322528"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11402763_10","type":"book-chapter","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T15:15:23Z","timestamp":1129907723000},"page":"128-141","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for the Maximum Hamming Distance Problem"],"prefix":"10.1007","author":[{"given":"Ola","family":"Angelsmark","sequence":"first","affiliation":[]},{"given":"Johan","family":"Thapper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Angelsmark, O., Thapper, J.: Microstructure based algorithms for three constraint satisfaction optimisation problems (2004) (unpublished manuscript), available for download at, \n                    \n                      http:\/\/www.ida.liu.se\/~olaan\/papers\/three_algorithms.ps"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters\u00a08(3), 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0304-3975(01)00146-3","volume":"288","author":"P. Crescenzi","year":"2002","unstructured":"Crescenzi, P., Rossi, G.: On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science\u00a0288(1), 85\u2013100 (2002)","journal-title":"Theoretical Computer Science"},{"key":"10_CR4","unstructured":"Dahll\u00f6f, V., Jonsson, P., Wahlstr\u00f6m, M.: On counting models for 2sat and 3sat formulae (2003) (unpublished manuscript), available for download at, \n                    \n                      http:\/\/www.ida.liu.se\/~magwa\/research\/merge23sat.ps"},{"key":"10_CR5","unstructured":"Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA 2001), pp. 329\u2013337 (2001)"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0196-6774(02)00224-9","volume":"45","author":"T. Feder","year":"2002","unstructured":"Feder, T., Motwani, R.: Worst-case time bounds for coloring and satisfiability problems. Journal of Algorithms\u00a045(2), 192\u2013201 (2002)","journal-title":"Journal of Algorithms"},{"key":"10_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"10_CR8","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":"10_CR9","first-page":"731","volume-title":"Proceedings of the 11th (US) National Conference on Artificial Intelligence (AAAI 1993)","author":"P. J\u00e9gou","year":"1993","unstructured":"J\u00e9gou, P.: Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In: Proceedings of the 11th (US) National Conference on Artificial Intelligence (AAAI 1993), Washington, DC, USA, July 1993, pp. 731\u2013736. AAAI, Menlo Park (1993)"},{"issue":"1-2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","volume":"223","author":"O. Kullman","year":"1999","unstructured":"Kullman, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science\u00a0223(1-2), 1\u201372 (1999)","journal-title":"Theoretical Computer Science"},{"key":"10_CR11","first-page":"410","volume-title":"40th Annual Symposium on Foundations of Computer Science (FOCS 1999)","author":"U. Sch\u00f6ning","year":"1999","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 410\u2013414. IEEE Computer Society, Los Alamitos (1999)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11402763_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:46:56Z","timestamp":1558295216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11402763_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251767","9783540322528"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11402763_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}