{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:28:02Z","timestamp":1725600482575},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"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-22685-4_13","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"146-157","source":"Crossref","is-referenced-by-count":0,"title":["Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities"],"prefix":"10.1007","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kowalczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Exactly solved models in statistical mechanics","author":"R. Baxter","year":"1982","unstructured":"Baxter, R.: Exactly solved models in statistical mechanics. Academic Press, London (1982)"},{"issue":"1","key":"13_CR2","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. J. ACM\u00a053(1), 66\u2013120 (2006)","journal-title":"J. ACM"},{"key":"13_CR3","unstructured":"Bulatov, A.A.: The complexity of the counting constraint satisfaction problem. Electronic Colloquium on Computational Complexity (ECCC) 14(093) (2007), \n                  \n                    http:\/\/eccc.hpi-web.de\/eccc-reports\/2007\/TR07-093\/index.html"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-540-70575-8_53","volume-title":"Automata, Languages and Programming","author":"A.A. Bulatov","year":"2008","unstructured":"Bulatov, A.A.: The complexity of the counting constraint satisfaction problem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 646\u2013661. Springer, Heidelberg (2008)"},{"issue":"5","key":"13_CR5","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.ic.2006.09.005","volume":"205","author":"A.A. Bulatov","year":"2007","unstructured":"Bulatov, A.A., Dalmau, V.: Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput.\u00a0205(5), 651\u2013678 (2007)","journal-title":"Inf. Comput."},{"issue":"2-3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2005.09.011","volume":"348","author":"A.A. Bulatov","year":"2005","unstructured":"Bulatov, A.A., Grohe, M.: The complexity of partition functions. Theor. Comput. Sci.\u00a0348(2-3), 148\u2013186 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Cai, J.Y., Chen, X.: A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights. In: FOCS, pp. 437\u2013446 (2010)","DOI":"10.1109\/FOCS.2010.49"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-14165-2_24","volume-title":"Automata, Languages and Programming","author":"J.Y. Cai","year":"2010","unstructured":"Cai, J.Y., Chen, X., Lu, P.: Graph homomorphisms with complex values: A dichotomy theorem. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 275\u2013286. Springer, Heidelberg (2010)"},{"key":"13_CR9","unstructured":"Cai, J.Y., Chen, X., Lu, P.: Non-negative weighted #CSPs: An effective complexity dichotomy, arXiv 1012.5659 (2010)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-13562-0_30","volume-title":"Theory and Applications of Models of Computation","author":"J.Y. Cai","year":"2010","unstructured":"Cai, J.Y., Kowalczyk, M.: A dichotomy for k-regular graphs with {0, 1}-vertex assignments and real edge functions. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 328\u2013339. Springer, Heidelberg (2010)"},{"issue":"23","key":"13_CR11","doi-asserted-by":"publisher","first-page":"2468","DOI":"10.1016\/j.tcs.2010.10.039","volume":"412","author":"J.Y. Cai","year":"2011","unstructured":"Cai, J.Y., Lu, P., Xia, M.: A computational proof of complexity of some restricted counting problems. Theor. Comput. Sci.\u00a0412(23), 2468\u20132485 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of boolean constraint satisfaction problems. SIAM Monographs on Discrete Mathematics and Applications (2001)","DOI":"10.1137\/1.9780898718546"},{"key":"13_CR13","unstructured":"Dyer, M., Richerby, D.: An effective dichotomy for the counting constraint satisfaction problem, arXiv 1003.3879 (2010)"},{"issue":"5","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1137\/070690201","volume":"38","author":"M.E. Dyer","year":"2009","unstructured":"Dyer, M.E., Goldberg, L.A., Jerrum, M.: The complexity of weighted boolean CSP. SIAM J. Comput.\u00a038(5), 1970\u20131986 (2009)","journal-title":"SIAM J. Comput."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Dyer, M.E., Goldberg, L.A., Paterson, M.: On counting homomorphisms to directed acyclic graphs. J. ACM\u00a054(6) (2007)","DOI":"10.1145\/1314690.1314691"},{"issue":"3-4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W","volume":"17","author":"M.E. Dyer","year":"2000","unstructured":"Dyer, M.E., Greenhill, C.S.: The complexity of counting graph homomorphisms. Random Struct. Algorithms\u00a017(3-4), 260\u2013289 (2000)","journal-title":"Random Struct. Algorithms"},{"issue":"7","key":"13_CR17","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1137\/090757496","volume":"39","author":"L.A. Goldberg","year":"2010","unstructured":"Goldberg, L.A., Grohe, M., Jerrum, M., Thurley, M.: A complexity dichotomy for partition functions with mixed signs. SIAM J. Comput.\u00a039(7), 3336\u20133402 (2010)","journal-title":"SIAM J. Comput."},{"key":"13_CR18","unstructured":"Kowalczyk, M., Cai, J.Y.: Holant problems for regular graphs with complex edge functions. In: Marion, J.Y., Schwentick, T. (eds.) STACS, pp. 525\u2013536 (2010)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1080\/14786436108243366","volume":"6","author":"H.N.V. Temperley","year":"1961","unstructured":"Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics \u2014 an exact result. Philosophical Magazine\u00a06, 1061\u20131063 (1961)","journal-title":"Philosophical Magazine"},{"issue":"5","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1137\/070682575","volume":"37","author":"L.G. Valiant","year":"2008","unstructured":"Valiant, L.G.: Holographic algorithms. SIAM J. Comput.\u00a037(5), 1565\u20131594 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2007.05.023","volume":"384","author":"M. Xia","year":"2007","unstructured":"Xia, M., Zhang, P., Zhao, W.: Computational complexity of counting problems on 3-regular planar graphs. Theor. Comput. Sci.\u00a0384(1), 111\u2013125 (2007)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T08:56:01Z","timestamp":1554022561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}