{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:57:21Z","timestamp":1742947041954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865924"},{"type":"electronic","value":"9783030865931"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86593-1_9","type":"book-chapter","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:26:28Z","timestamp":1631391988000},"page":"135-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartite 3-Regular Counting Problems with Mixed Signs"],"prefix":"10.1007","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7714-2195","authenticated-orcid":false,"given":"Austen Z.","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Yin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"9_CR1","unstructured":"Backens, M.: A new Holant dichotomy inspired by quantum computation. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP, pp. 16:1\u201316:14 (2017)"},{"key":"9_CR2","unstructured":"Backens, M.: A complete dichotomy for complex-valued $$\\operatorname{Holant}^{c}$$. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP, pp. 12:1\u201312:14 (2018)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Backens, M., Goldberg, L.A.: Holant clones and the approximability of conservative Holant problems. ACM Trans. Algorithms 16(2), 23:1\u201323:55 (2020)","DOI":"10.1145\/3381425"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"AA Bulatov","year":"2006","unstructured":"Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM (JACM) 53(1), 66\u2013120 (2006)","journal-title":"J. ACM (JACM)"},{"key":"9_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/9781107477063","volume-title":"Complexity Dichotomies for Counting Problems: Boolean Domain","author":"J Cai","year":"2017","unstructured":"Cai, J., Chen, X.: Complexity Dichotomies for Counting Problems: Boolean Domain, vol. 1. Cambridge University Press, Cambridge (2017)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cai, J., Chen, X.: Complexity of counting CSP with complex weights. J. ACM 64(3), 19:1\u201319:39 (2017)","DOI":"10.1145\/2822891"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1137\/15M1032314","volume":"45","author":"J Cai","year":"2016","unstructured":"Cai, J., Chen, X., Lu, P.: Nonnegative weighted# CSP: an effective complexity dichotomy. SIAM J. Comput. 45(6), 2177\u20132198 (2016)","journal-title":"SIAM J. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Cai, J., Fu, Z., Guo, H., Williams, T.: A Holant dichotomy: is the FKT algorithm universal? In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS, pp. 1259\u20131276 (2015)","DOI":"10.1109\/FOCS.2015.81"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1137\/15M1049798","volume":"45","author":"J Cai","year":"2016","unstructured":"Cai, J., Guo, H., Williams, T.: A complete dichotomy rises from the capture of vanishing signatures. SIAM J. Comput. 45(5), 1671\u20131728 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jcss.2010.06.005","volume":"77","author":"J Cai","year":"2011","unstructured":"Cai, J., Lu, P.: Holographic algorithms: from art to science. J. Comput. Syst. Sci. 77(1), 41\u201361 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Cai, J., Lu, P., Xia, M.: Holant problems and counting CSP. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 715\u2013724 (2009)","DOI":"10.1145\/1536414.1536511"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Cai, J., Lu, P., Xia, M.: Holographic algorithms with matchgates capture precisely tractable planar #CSP. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 427\u2013436 (2010)","DOI":"10.1109\/FOCS.2010.48"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(92)90234-7","volume":"102","author":"P Dagum","year":"1992","unstructured":"Dagum, P., Luby, M.: Approximating the permanent of graphs with large factors. Theor. Comput. Sci. 102(2), 283\u2013305 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/100811258","volume":"42","author":"M Dyer","year":"2013","unstructured":"Dyer, M., Richerby, D.: An effective dichotomy for the counting constraint satisfaction problem. SIAM J. Comput. 42(3), 1245\u20131274 (2013)","journal-title":"SIAM J. Comput."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Fan, A.Z., Cai, J.: Dichotomy result on 3-regular bipartite non-negative functions. arXiv preprint arXiv:2011.09110 (2020)","DOI":"10.1007\/978-3-030-79416-3_6"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1090\/S0894-0347-06-00529-7","volume":"20","author":"M Freedman","year":"2007","unstructured":"Freedman, M., Lov\u00e1sz, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphism of graphs. J. Am. Math. Soc. 20(1), 37\u201351 (2007)","journal-title":"J. Am. Math. Soc."},{"key":"9_CR17","unstructured":"Guo, H., Huang, S., Lu, P., Xia, M.: The complexity of weighted Boolean #CSP modulo K. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS, pp. 249\u2013260 (2011)"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1137\/100815530","volume":"42","author":"H Guo","year":"2013","unstructured":"Guo, H., Lu, P., Valiant, L.G.: The complexity of symmetric Boolean parity Holant problems. SIAM J. Comput. 42(1), 324\u2013356 (2013)","journal-title":"SIAM J. Comput."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Hell, P., Nesetril, J.: Graphs and Homomorphisms, Oxford Lecture Series in Mathematics and its Applications, vol. 28. Oxford University Press (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"9_CR20","unstructured":"Kowalczyk, M., Cai, J.: Holant problems for regular graphs with complex edge functions. In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS, pp. 525\u2013536 (2010)"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1090\/S0894-0347-07-00568-1","volume":"20","author":"B Szegedy","year":"2007","unstructured":"Szegedy, B.: Edge coloring models and reflection positivity. J. Am. Math. Soc. 20(4), 969\u2013988 (2007)","journal-title":"J. Am. Math. Soc."},{"key":"9_CR22","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-13580-4_12","volume-title":"Fete of Combinatorics and Computer Science","author":"B Szegedy","year":"2010","unstructured":"Szegedy, B.: Edge coloring models as singular vertex coloring models. In: Katona, G.O.H., Schrijver, A., Sz\u00f5nyi, T., S\u00e1gi, G. (eds.) Fete of Combinatorics and Computer Science. BSMS, pp. 327\u2013336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13580-4_12"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"SP Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31(2), 398\u2013427 (2001)","journal-title":"SIAM J. Comput."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Accidental algorthims. In: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 509\u2013517. IEEE (2006)","DOI":"10.1109\/FOCS.2006.7"},{"issue":"5","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1137\/070682575","volume":"37","author":"LG Valiant","year":"2008","unstructured":"Valiant, L.G.: Holographic algorithms. SIAM J. Comput. 37(5), 1565\u20131594 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00037-017-0160-4","volume":"27","author":"LG Valiant","year":"2017","unstructured":"Valiant, L.G.: Some observations on holographic algorithms. Comput. Complex. 27(3), 351\u2013374 (2017). https:\/\/doi.org\/10.1007\/s00037-017-0160-4","journal-title":"Comput. Complex."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Xia, M.: Holographic reduction: a domain changed application and its partial converse theorems. In: Automata, Languages and Programming, pp. 666\u2013677 (2010)","DOI":"10.1007\/978-3-642-14165-2_56"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86593-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:39:06Z","timestamp":1673224746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86593-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865924","9783030865931"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86593-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/fct2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.54","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic. There are papers of 2 invited talks also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}