{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:36:04Z","timestamp":1725536164205},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033506"},{"type":"electronic","value":"9783642033513"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03351-3_21","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T12:53:58Z","timestamp":1249304038000},"page":"215-226","source":"Crossref","is-referenced-by-count":1,"title":["Approximability of the Maximum Solution Problem for Certain Families of Algebras"],"prefix":"10.1007","author":[{"given":"Peter","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Johan","family":"Thapper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jalgebra.2004.07.044","volume":"298","author":"A. Bulatov","year":"2006","unstructured":"Bulatov, A.: Combinatorial problems raised from 2-semilattices. Journal of Algebra\u00a0298, 321\u2013339 (2006)","journal-title":"Journal of Algebra"},{"issue":"3","key":"21_CR3","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 Journal on Computing\u00a034(3), 720\u2013742 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/sapm1970493239","volume":"49","author":"J. Goldman","year":"1970","unstructured":"Goldman, J., Rota, G.-C.: On the foundations of combinatorial theory IV. Finite vector spaces and Eulerian generating functions. Studies in Appl. Math.\u00a049, 239\u2013258 (1970)","journal-title":"Studies in Appl. Math."},{"issue":"1-2","key":"21_CR5","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":"21_CR6","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"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/060669231","volume":"38","author":"P. Jonsson","year":"2008","unstructured":"Jonsson, P., Kuivinen, F., Nordh, G.: Max Ones generalized to larger domains. SIAM Journal on Computing\u00a038(1), 329\u2013365 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/11821069_48","volume-title":"Mathematical Foundations of Computer Science 2006","author":"P. Jonsson","year":"2006","unstructured":"Jonsson, P., Nordh, G.: Generalised integer programming based on logically defined relations. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 549\u2013560. Springer, Heidelberg (2006)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-74456-6_22","volume-title":"Mathematical Foundations of Computer Science 2007","author":"P. Jonsson","year":"2007","unstructured":"Jonsson, P., Nordh, G., Thapper, J.: The maximum solution problem on graphs. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 228\u2013239. Springer, Heidelberg (2007)"},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1137\/S0097539799349948","volume":"30","author":"S. Khanna","year":"2000","unstructured":"Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM Journal on Computing\u00a030(6), 1863\u20131920 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/11549345_54","volume-title":"Mathematical Foundations of Computer Science 2005","author":"F. Kuivinen","year":"2005","unstructured":"Kuivinen, F.: Tight approximability results for the maximum solution equation problem over Z\n                  \n                    p\n                  . In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 628\u2013639. Springer, Heidelberg (2005)"},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5547-1","volume-title":"Funktionen- und Relationenalgebren","author":"R. P\u00f6schel","year":"1979","unstructured":"P\u00f6schel, R., Kalu\u017enin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)"},{"key":"21_CR13","first-page":"1","volume":"5","author":"E. Post","year":"1941","unstructured":"Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies\u00a05, 1\u2013122 (1941)","journal-title":"Annals of Mathematical Studies"},{"key":"21_CR14","unstructured":"Szendrei, \u00c1.: Clones in Universal Algebra. Seminaires de Math\u00e9matiques Sup\u00e9rieures, vol.\u00a099. University of Montreal (1986)"},{"key":"21_CR15","first-page":"259","volume-title":"Contributions to General Algebra 6","author":"\u00c1. Szendrei","year":"1989","unstructured":"Szendrei, \u00c1.: Symmetric algebras. In: Contributions to General Algebra 6, pp. 259\u2013280. Verlag H\u00f6lder-Pichler-Tempsky, Wien and Verlag Teubner, Stuttgart (1989)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1017\/S1446788700029979","volume":"48","author":"\u00c1. Szendrei","year":"1990","unstructured":"Szendrei, \u00c1.: Simple surjective algebras having no proper subalgebras. J. Austral. Math. Soc. ser. A\u00a048, 434\u2013454 (1990)","journal-title":"J. Austral. Math. Soc. ser. A"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03351-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:59:53Z","timestamp":1552118393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03351-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033506","9783642033513"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03351-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}