{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:55Z","timestamp":1725525355267},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"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-00202-1_25","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"286-297","source":"Crossref","is-referenced-by-count":3,"title":["On the Computational Complexity of Monotone Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Miki","family":"Hermann","sequence":"first","affiliation":[]},{"given":"Florian","family":"Richoux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"A.A. Bulatov","year":"2006","unstructured":"Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the Association for Computing Machinery\u00a053(1), 66\u2013120 (2006)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/355483.355485","volume":"47","author":"D. Cohen","year":"2000","unstructured":"Cohen, D., Jeavons, P., Jonsson, P., Koubarakis, M.: Building tractable disjunctive constraints. Journal of the Association for Computing Machinery\u00a047(5), 826\u2013853 (2000)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"25_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parametrized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)"},{"issue":"1","key":"25_CR4","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 Journal on Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"25_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"},{"key":"25_CR6","first-page":"367","volume":"17","author":"M. Krasner","year":"1938","unstructured":"Krasner, M.: Une g\u00e9n\u00e9ralisation de la notion de corps. Journal de Math\u00e9matiques pures et appliqu\u00e9es\u00a017, 367\u2013385 (1938)","journal-title":"Journal de Math\u00e9matiques pures et appliqu\u00e9es"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-1-4020-1898-5_5","volume-title":"Galois Connections and Applications","author":"R. P\u00f6schel","year":"2004","unstructured":"P\u00f6schel, R.: Galois connections for operations and relations. In: Denecke, K., et al. (eds.) Galois Connections and Applications, pp. 231\u2013258. Kluwer, Dordrecht (2004)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(01)00227-4","volume":"292","author":"A. Salomaa","year":"2003","unstructured":"Salomaa, A.: Composition sequences for functions over a finite domain. Theoretical Computer Science\u00a0292(1), 263\u2013281 (2003)","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing (STOC 1978), San Diego, California, USA, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"25_CR10","first-page":"44","volume":"127","author":"Y..I. Yanov","year":"1959","unstructured":"Yanov, Y.I., Muchnik, A.A.: On the existence of k-valued closed classes that have no bases. Doklady Akademii Nauk SSSR\u00a0127, 44\u201346 (1959) (in Russian)","journal-title":"Doklady Akademii Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T04:57:21Z","timestamp":1547873841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}