{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:26:46Z","timestamp":1726410406228},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_36","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:33:02Z","timestamp":1407825182000},"page":"420-431","source":"Crossref","is-referenced-by-count":0,"title":["Affine Consistency and the Complexity of Semilinear Constraints"],"prefix":"10.1007","author":[{"given":"Peter","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Johan","family":"Thapper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-70583-3_16","volume-title":"Automata, Languages and Programming","author":"M. Bodirsky","year":"2008","unstructured":"Bodirsky, M., Grohe, M.: Non-dichotomies in constraint satisfaction complexity. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 184\u2013196. Springer, Heidelberg (2008)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Jonsson, P., von Oertzen, T.: Essential convexity and complexity of semi-algebraic constraints. Logical Methods in Computer Science\u00a08(4) (2012)","DOI":"10.2168\/LMCS-8(4:5)2012"},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1093\/logcom\/exr011","volume":"22","author":"M. Bodirsky","year":"2012","unstructured":"Bodirsky, M., Jonsson, P., von Oertzen, T.: Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput.\u00a022(3), 643\u2013660 (2012)","journal-title":"J. Log. Comput."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., K\u00e1ra, J.: The complexity of temporal constraint satisfaction problems. J.\u00a0ACM\u00a057(2) (2010)","DOI":"10.1145\/1667053.1667058"},{"issue":"1","key":"36_CR5","first-page":"66","volume":"53","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J.\u00a0ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"J.\u00a0ACM"},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the computational complexity of constraints using finte algebras. SIAM J. Comput.\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of the 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 612\u2013622 (1993)","DOI":"10.1145\/167088.167245"},{"issue":"3","key":"36_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.cosrev.2008.10.003","volume":"2","author":"P. Hell","year":"2008","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Colouring, constraint satisfaction, and complexity. Computer Science Review\u00a02(3), 143\u2013163 (2008)","journal-title":"Computer Science Review"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.artint.2012.10.001","volume":"195","author":"P. Jonsson","year":"2013","unstructured":"Jonsson, P., L\u00f6\u00f6w, T.: Computational complexity of linear constraints over the integers. Artif. Intell.\u00a0195, 44\u201362 (2013)","journal-title":"Artif. Intell."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"36_CR11","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons (1986)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:14:54Z","timestamp":1558955694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}