{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:45Z","timestamp":1760202525439,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_36","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"342-352","source":"Crossref","is-referenced-by-count":17,"title":["Towards a Trichotomy for Quantified H-Coloring"],"prefix":"10.1007","author":[{"given":"Barnaby","family":"Martin","sequence":"first","affiliation":[]},{"given":"Florent","family":"Madelaine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","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. J. Combin. Theory Ser. B\u00a048(1), 92\u2013110 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: 10th Annual ACM Symp. on Theory of Computing (1978)","DOI":"10.1145\/800133.804350"},{"issue":"1\u20132","key":"36_CR3","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. Theoret. Comput. Sci.\u00a0200(1\u20132), 185\u2013204 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput.\u00a034(3) (2005)","DOI":"10.1137\/S0097539700376676"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bulatov, A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS 2002 (to appear, 2002)","DOI":"10.1109\/SFCS.2002.1181990"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1999","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. Comput.\u00a028(1), 57\u2013104 (1999)","journal-title":"SIAM J. Comput."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of Boolean constraint satisfaction problems. In: SIAM Monographs on Discrete Mathematics and Applications (2001)","DOI":"10.1137\/1.9780898718546"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Dalmau, V.: A dichotomy theorem for learning quantified boolean formulas. Machine Learning\u00a035(3) (1999)","DOI":"10.1023\/A:1007582729656"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-45220-1_6","volume-title":"Computer Science Logic","author":"F. B\u00f6rner","year":"2003","unstructured":"B\u00f6rner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified constraints: algorithms and complexity. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 58\u201370. Springer, Heidelberg (2003)"},{"key":"36_CR10","unstructured":"Chen, H.: Collapsibility and consistency in quantified constraint satisfaction. In: Procs. 19th National Conference on AI (2004)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-540-48085-3_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"M. Bj\u00e4reland","year":"1999","unstructured":"Bj\u00e4reland, M., Jonsson, P.: Exploiting bipartiteness to identify yet another tractable subclass of CSP. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 118\u2013128. Springer, Heidelberg (1999)"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Gradel, E.: Model checking games. Electronic Notes in Theoretical Computer Science\u00a067 (2002)","DOI":"10.1016\/S1571-0661(04)80538-3"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and homomorphisms. Oxford Lecture Series in Maths and its Applications, vol.\u00a028. OUP (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T22:45:03Z","timestamp":1552344303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11780342_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}