{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:25:55Z","timestamp":1725560755113},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_17","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T13:31:28Z","timestamp":1129642288000},"page":"196-210","source":"Crossref","is-referenced-by-count":3,"title":["Tractable Clones of Polynomials over Semigroups"],"prefix":"10.1007","author":[{"given":"V\u00edctor","family":"Dalmau","sequence":"first","affiliation":[]},{"given":"Ricard","family":"Gavald\u00e0","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Tesson","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proc. of 43rd Foundations of Comp. Sci (FOCS 2002), pp. 649\u2013658 (2002)","DOI":"10.1109\/SFCS.2002.1181990"},{"key":"17_CR2","unstructured":"Bulatov, A.: Malt\u2019sev constrains are tractable. In: Electronic Colloquium on Computational Complexity (ECCC) (2002)"},{"key":"17_CR3","unstructured":"Bulatov, A., Dalmau, V.: A simple algorithm for Malt\u2019sev constraints (submitted 2005)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-45193-8_13","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"A. Bulatov","year":"2003","unstructured":"Bulatov, A., Jeavons, P.: An algebraic approach to multi-sorted constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 183\u2013198. Springer, Heidelberg (2003)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Jeavons, P., Volkov, M.: Finite semigroups imposing tractable constraints. In: Gomez, G., Silva, P., Pin, J.-E. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 313\u2013329. WSP (2002)","DOI":"10.1142\/9789812776884_0011"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45022-X_24","volume-title":"Automata, Languages and Programming","author":"A. Bulatov","year":"2000","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: Constraint satisfaction problems and finite algebras. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 272\u2013282. Springer, Heidelberg (2000)"},{"key":"17_CR7","unstructured":"Dalmau, V.: A new tractable class of constraint satisfaction problems. In: 6th Int.\u00a0Symp\u00a0on Artificial Intelligence and Mathematics (2000)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-48085-3_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"V. Dalmau","year":"1999","unstructured":"Dalmau, V., Pearson, J.: Closure functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 159\u2013173. Springer, Heidelberg (1999)"},{"key":"17_CR9","unstructured":"Feder, T.: Constraint satisfaction on finite groups with near subgroups. In: Electronic Colloquium on Computational Complexity (ECCC) (2005)"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. on Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM J. on Computing"},{"issue":"1-2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"P. Jeavons","year":"1998","unstructured":"Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science\u00a0200(1-2), 185\u2013204 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"17_CR12","first-page":"527","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. J.\u00a0ACM\u00a044(4), 527\u2013548 (1997)","journal-title":"J.\u00a0ACM"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Kl\u00edma, O., Tesson, P., Th\u00e9rien, D.: Dichotomies in the complexity of solving systems of equations over finite semigroups. Theory of Computing Systems (2005)","DOI":"10.1007\/s00224-005-1279-2"},{"key":"17_CR14","unstructured":"Larose, B., Z\u00e1dori, L.: Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras. Submitted for publication (2004)"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-94-011-0149-3_2","volume-title":"NATO Advanced Study Institute Semigroups, Formal Languages and Groups","author":"J.-\u00c9. Pin","year":"1995","unstructured":"Pin, J.-\u00c9.: PG\u2009=\u2009BG, a success story. In: Fountain, J. (ed.) NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pp. 33\u201347. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10 th ACM STOC, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T10:12:47Z","timestamp":1586513567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11564751_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}