{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:16:47Z","timestamp":1725603407584},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"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-23786-7_18","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"210-224","source":"Crossref","is-referenced-by-count":4,"title":["On Minimal Weighted Clones"],"prefix":"10.1007","author":[{"given":"P\u00e1id\u00ed","family":"Creed","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"\u017divn\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"18_CR1","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 American Mathematical Society\u00a0137(9), 2921\u20132934 (2009)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"5","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1137\/070708093","volume":"38","author":"L. Barto","year":"2009","unstructured":"Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks. SIAM Journal on Computing\u00a038(5), 1782\u20131802 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Barto, L.: The dichotomy for conservative constraint satisfaction problems revisited. In: Proc. of LICS 2011 (2011)","DOI":"10.1109\/LICS.2011.25"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Barto, L., Kozik, M.: Constraint Satisfaction Problems of Bounded Width. In: Proc. of FOCS 2009, pp. 461\u2013471 (2009)","DOI":"10.1109\/FOCS.2009.32"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1090\/S0002-9947-09-04874-0","volume":"362","author":"J. Berman","year":"2010","unstructured":"Berman, J., Idziak, P., Markovi\u0107, P., McKenzie, R., Valeriote, M., Willard, R.: Varieties with few subalgebras of powers. Trans. of AMS\u00a0362(3), 1445\u20131473 (2010)","journal-title":"Trans. of AMS"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: The complexity of maximal constraint languages. In: Proc. of STOC 2001, pp. 667\u2013674 (2001)","DOI":"10.1145\/380752.380868"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: A Graph of a Relational Structure and Constraint Satisfaction Problems. In: Proc. of LICS 2004, pp. 448\u2013457 (2004)","DOI":"10.1109\/LICS.2004.1319639"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"Journal of the ACM"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Krokhin, A., Jeavons, P.: Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on Computing\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: Tractable Conservative Constraint Satisfaction Problems. In: Proc. of LICS 2003, pp. 321\u2013330 (2003)","DOI":"10.1109\/LICS.2003.1210072"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11889205_10","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"D.A. Cohen","year":"2006","unstructured":"Cohen, D.A., Cooper, M.C., Jeavons, P.G.: An Algebraic Characterisation of Complexity for Valued Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 107\u2013121. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2008.03.015","volume":"401","author":"D.A. Cohen","year":"2008","unstructured":"Cohen, D.A., Cooper, M.C., Jeavons, P.G.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science\u00a0401(1-3), 36\u201351 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"18_CR13","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.artint.2006.04.002","volume":"170","author":"D.A. Cohen","year":"2006","unstructured":"Cohen, D.A., Cooper, M.C., Jeavons, P.G., Krokhin, A.A.: The Complexity of Soft Constraint Satisfaction. Artificial Intelligence\u00a0170(11), 983\u20131016 (2006)","journal-title":"Artificial Intelligence"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-22993-0_23","volume-title":"Mathematical Foundations of Computer Science 2011","author":"D. Cohen","year":"2011","unstructured":"Cohen, D., Creed, P., Jeavons, P., \u017divn\u00fd, S.: An algebraic theory of complexity for valued constraints: Establishing a Galois connection. In: Murlak, F., Sankowski, P. (eds.) Mathematical Foundations of Computer Science 2011. LNCS, vol.\u00a06907, pp. 231\u2013242. Springer, Heidelberg (2011)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1006\/jcss.1995.1087","volume":"51","author":"N. Creignou","year":"1995","unstructured":"Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences\u00a051(3), 511\u2013522 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR16","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718546","volume-title":"Complexity Classification of Boolean Constraint Satisfaction Problems","author":"N. Creignou","year":"2001","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a07. SIAM, Philadelphia (2001)"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00012-005-1924-2","volume":"54","author":"B. Cs\u00e1k\u00e1ny","year":"2005","unstructured":"Cs\u00e1k\u00e1ny, B.: Minimal clones \u2013 a minicourse. Algebra Universalis\u00a054(1), 73\u201389 (2005)","journal-title":"Algebra Universalis"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Denecke, K., Wismath, S.: Universal Algebra and Applications in Theoretical Computer Science. Chapman and Hall\/CRC Press (2002)","DOI":"10.1201\/9781315273686"},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM Journal on Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"18_CR20","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":"18_CR21","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. Journal of the ACM\u00a044(4), 527\u2013548 (1997)","journal-title":"Journal of the ACM"},{"key":"18_CR22","unstructured":"Kolmogorov, V., \u017divn\u00fd, S.: The complexity of conservative finite-valued CSPs. Technical repport arXiv:1008.1555 (August 2010)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., \u017divn\u00fd, S.: The complexity of conservative valued CSPs (submitted for publication, 2011)","DOI":"10.1137\/1.9781611973099.61"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization (1988)","DOI":"10.1002\/9781118627372"},{"key":"18_CR25","series-title":"Annals of Mathematical Studies","volume-title":"The two-valued iterative systems of mathematical logic","author":"E. Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies, vol.\u00a05. Princeton University Press, Princeton (1941)"},{"key":"18_CR26","first-page":"405","volume-title":"Lectures in Universal Algebra (Proc. Conf. Szeged 1983). Colloq. Math. Soc. Janos Bolyai","author":"I. Rosenberg","year":"1986","unstructured":"Rosenberg, I.: Minimal Clones I: the five types. In: Lectures in Universal Algebra (Proc. Conf. Szeged 1983). Colloq. Math. Soc. Janos Bolyai, vol.\u00a043, pp. 405\u2013427. North-Holland, Amsterdam (1986)"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Schaefer, T.: The Complexity of Satisfiability Problems. In: Proc. of STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"18_CR28","unstructured":"Schrijver, A.: Theory of linear and integer programming (1986)"},{"key":"18_CR29","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency (2003)"},{"key":"18_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.4064\/fm-49-1-93-104","volume":"49","author":"S. \u015awierczkowski","year":"1960","unstructured":"\u015awierczkowski, S.: Algebras which are independently generated by every n elements. Fundamenta Mathematicae\u00a049, 93\u2013104 (1960)","journal-title":"Fundamenta Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:36:40Z","timestamp":1560515800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}