{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:35:16Z","timestamp":1743042916395,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207112"},{"type":"electronic","value":"9783642207129"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_14","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"181-194","source":"Crossref","is-referenced-by-count":4,"title":["On Maltsev Digraphs"],"prefix":"10.1007","author":[{"given":"Catarina","family":"Carvalho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Egri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Niven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Barto, L., Bulin, J.: CSP dichotomy for special polyads (2011) (submitted)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"2921","DOI":"10.1090\/S0002-9939-09-09883-9","volume":"137","author":"L. Barto","year":"2009","unstructured":"Barto, L., Kozik, M., Mar\u00f3ti, M., Niven, T.: CSP dichotomy for special triads. Proceedings of the AMS\u00a0137, 2921\u20132934 (2009)","journal-title":"Proceedings of the AMS"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Barto, L., Kozik, M., Niven, T.: Graphs, polymorphisms and the complexity of homomorphism problems. In: Proceedings of the 40th annual ACM Symposium on Theory of Computing, STOC 2008, pp. 789\u2013796 (2008)","DOI":"10.1145\/1374376.1374488"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1137\/050628957","volume":"36","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A., Dalmau, V.: A simple algorithm for Mal\u2019tsev constraints. SIAM Journal on Computing\u00a036(1), 16\u201327 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR5","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.A. Bulatov","year":"2000","unstructured":"Bulatov, A.A., Krokhin, A.A., Jeavons, P.G.: Constraint satisfaction problems and finite algebras. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 272. Springer, Heidelberg (2000)"},{"issue":"3","key":"14_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 complexity of constraints using finite algebras. SIAM Journal on Computing\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-92800-3_5","volume-title":"Complexity of Constraints","author":"A.A. Bulatov","year":"2008","unstructured":"Bulatov, A.A., Krokhin, A.A., Larose, B.: Dualities for constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. LNCS, vol.\u00a05250, pp. 93\u2013124. Springer, Heidelberg (2008)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-1(1:5)2005","volume":"1","author":"V. Dalmau","year":"2005","unstructured":"Dalmau, V.: Linear Datalog and bounded path duality of relational structures. Logical Methods in Computer Science\u00a01, 1\u201332 (2005)","journal-title":"Logical Methods in Computer Science"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.ejc.2007.11.020","volume":"29","author":"V. Dalmau","year":"2008","unstructured":"Dalmau, V., Krokhin, A.: Majority constraints have bounded pathwidth duality. European Journal of Combinatorics\u00a029(4), 821\u2013837 (2008)","journal-title":"European Journal of Combinatorics"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Dalmau, V., Larose, B.: Maltsev + Datalog \u21d2 Symmetric Datalog. In: Proceedings of the 23rd IEEE Symposium on Logic in Computer Science, LICS 2008, pp. 297\u2013306 (2008)","DOI":"10.1109\/LICS.2008.14"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dyer, M.E., Richerby, D.: On the complexity of #CSP. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 725\u2013734 (2010)","DOI":"10.1145\/1806689.1806789"},{"key":"14_CR12","unstructured":"Egri, L.: On CSPs below P and the NL \u2260 P conjecture (2011) (submitted)"},{"key":"14_CR13","unstructured":"Egri, L., Krokhin, A.A., Larose, B., Tesson, P.: The complexity of the list homomorphism problem for graphs. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, pp. 335\u2013346 (2010)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Egri, L., Larose, B., Tesson, P.: Symmetric Datalog and constraint satisfaction problems in logspace. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007, pp. 193\u2013202 (2007)","DOI":"10.1109\/LICS.2007.47"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BF02945100","volume":"3","author":"J. Hagemann","year":"1973","unstructured":"Hagemann, J., Mitschke, A.: On n-permutable congruences. Algebra Universalis\u00a03, 8\u201312 (1973)","journal-title":"Algebra Universalis"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Hell, P., Rafiey, A.: The dichotomy of list homomorphisms for digraphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1703\u20131713 (2011)","DOI":"10.1137\/1.9781611973082.131"},{"issue":"4","key":"14_CR18","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. ACM\u00a044(4), 527\u2013548 (1997)","journal-title":"J. ACM"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ejc.2010.11.002","volume":"32","author":"A. Kazda","year":"2011","unstructured":"Kazda, A.: Maltsev digraphs have a majority polymorphism. European Journal of Combinatorics\u00a032, 390\u2013397 (2011)","journal-title":"European Journal of Combinatorics"},{"issue":"3-4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00012-008-2122-9","volume":"59","author":"M. Mar\u00f3ti","year":"2008","unstructured":"Mar\u00f3ti, M., McKenzie, R.: Existence theorems for weakly symmetric operations. Algebra Universalis\u00a059(3-4), 463\u2013489 (2008)","journal-title":"Algebra Universalis"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:43:45Z","timestamp":1553777025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}