{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:17:00Z","timestamp":1742973420377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319301389"},{"type":"electronic","value":"9783319301396"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30139-6_18","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T08:35:02Z","timestamp":1455870902000},"page":"222-235","source":"Crossref","is-referenced-by-count":5,"title":["As Close as It Gets"],"prefix":"10.1007","author":[{"given":"Mike","family":"Behrisch","sequence":"first","affiliation":[]},{"given":"Miki","family":"Hermann","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Mengel","sequence":"additional","affiliation":[]},{"given":"Gernot","family":"Salzer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","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.R., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York (1999)"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01187059","volume":"143","author":"KA Baker","year":"1975","unstructured":"Baker, K.A., Pixley, A.F.: Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems. Mathematische Zeitschrift 143(2), 165\u2013174 (1975)","journal-title":"Mathematische Zeitschrift"},{"key":"18_CR4","unstructured":"Behrisch, M., Hermann, M., Mengel, S., Salzer, G.: Minimal distance of propositional models (2015). \n                      abs\/1502.06761"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-662-48971-0_56","volume-title":"Algorithms and Computation","author":"M Behrisch","year":"2015","unstructured":"Behrisch, M., Hermann, M., Mengel, S., Salzer, G.: Give me another one!. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 664\u2013676. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-48971-0_56"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/970831.970840","volume":"35","author":"E B\u00f6hler","year":"2004","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: constraint satisfaction problems. SIGACT News 35(1), 22\u201335 (2004)","journal-title":"SIGACT News"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2005.06.003","volume":"96","author":"E B\u00f6hler","year":"2005","unstructured":"B\u00f6hler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean co-clones. Inf. Process. Lett. 96(2), 59\u201366 (2005)","journal-title":"Inf. Process. Lett."},{"key":"18_CR8","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718546","volume-title":"Complexity Classifications of Boolean Constraint Satisfaction Problems","author":"N Creignou","year":"2001","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol. 7. SIAM, Philadelphia (2001)"},{"issue":"1","key":"18_CR9","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. Theor. Comput. Sci. 288(1), 85\u2013100 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TIT.2002.806118","volume":"49","author":"I Dumer","year":"2003","unstructured":"Dumer, I., Micciancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Trans. Inf. Theory 49(1), 22\u201337 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J. Assoc. Comput. Mach. 44(4), 527\u2013548 (1997)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48321-7_27","volume-title":"Fundamentals of Computation Theory","author":"L Juban","year":"1999","unstructured":"Juban, L.: Dichotomy theorem for the generalized unique satisfiability problem. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 327\u2013337. Springer, Heidelberg (1999)"},{"issue":"9","key":"18_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.ipl.2014.03.011","volume":"114","author":"V Lagerkvist","year":"2014","unstructured":"Lagerkvist, V.: Weak bases of Boolean co-clones. Inf. Process. Lett. 114(9), 462\u2013468 (2014)","journal-title":"Inf. Process. Lett."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, San Diego, California, pp. 216\u2013226. ACM, New York (1978). \n                      http:\/\/dx.doi.org\/10.1145\/800133.804350","DOI":"10.1145\/800133.804350"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-92800-3_9","volume-title":"Complexity of Constraints","author":"H Schnoor","year":"2008","unstructured":"Schnoor, H., Schnoor, I.: Partial polymorphisms and constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol. 5250, pp. 229\u2013254. Springer, Heidelberg (2008)"},{"issue":"1","key":"18_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on Boolean matrices. J. Assoc. Comput. Mach. 9(1), 11\u201312 (1962)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30139-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:05:32Z","timestamp":1559387132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30139-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319301389","9783319301396"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30139-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}