{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:39:21Z","timestamp":1742996361547,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_6","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"83-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exponential Time Complexity of\u00a0the\u00a0Complex Weighted Boolean #CSP"],"prefix":"10.1007","author":[{"given":"Ying","family":"Liu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00453-018-0472-z","volume":"81","author":"C Brand","year":"2019","unstructured":"Brand, C., Dell, H., Roth, M.: Fine-grained dichotomies for the Tutte plane and Boolean #CSP. Algorithmica 81(2), 541\u2013556 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0472-z","journal-title":"Algorithmica"},{"issue":"38\u201340","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3949","DOI":"10.1016\/j.tcs.2009.06.003","volume":"410","author":"A Bulatov","year":"2009","unstructured":"Bulatov, A., Dyer, M., Goldberg, L.A., Jalsenius, M., Richerby, D.: The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38\u201340), 3949\u20133961 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528400","volume":"60","author":"AA Bulatov","year":"2013","unstructured":"Bulatov, A.A.: The complexity of the counting constraint satisfaction problem. J. ACM 60(5), 1\u201341 (2013). https:\/\/doi.org\/10.1145\/2528400","journal-title":"J. ACM"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Cai, J.Y., Chen, X.: Complexity Dichotomies for Counting Problems, vol. 1. Cambridge University Press, Cambridge (2017). https:\/\/doi.org\/10.1017\/9781107477063","DOI":"10.1017\/9781107477063"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2822891","volume":"64","author":"JY Cai","year":"2017","unstructured":"Cai, J.Y., Chen, X.: Complexity of counting CSP with complex weights. J. ACM 64(3), 1\u201339 (2017). https:\/\/doi.org\/10.1145\/2822891","journal-title":"J. ACM"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1137\/15M1032314","volume":"45","author":"JY Cai","year":"2016","unstructured":"Cai, J.Y., Chen, X., Lu, P.: Nonnegative weighted #CSP: an effective complexity dichotomy. SIAM J. Comput. 45(6), 2177\u20132198 (2016). https:\/\/doi.org\/10.1137\/15M1032314","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00037-023-00237-w","volume":"32","author":"JY Cai","year":"2023","unstructured":"Cai, J.Y., Fu, Z., Girstmair, K., Kowalczyk, M.: A complexity trichotomy for k-regular asymmetric spin systems using number theory. Comput. Complex. 32(4), 4 (2023). https:\/\/doi.org\/10.1007\/s00037-023-00237-w","journal-title":"Comput. Complex."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.jcss.2013.07.003","volume":"80","author":"JY Cai","year":"2014","unstructured":"Cai, J.Y., Lu, P., Xia, M.: The complexity of complex weighted Boolean #CSP. J. Comput. Syst. Sci. 80(1), 217\u2013236 (2014). https:\/\/doi.org\/10.1016\/j.jcss.2013.07.003","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-30786-8_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H Chen","year":"2019","unstructured":"Chen, H., Curticapean, R., Dell, H.: The exponential-time complexity of counting (quantum) graph homomorphisms. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 364\u2013378. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_28"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0016","volume":"125","author":"N Creignou","year":"1996","unstructured":"Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Inf. Comput. 125(1), 1\u201312 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0016","journal-title":"Inf. Comput."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ic.2018.02.008","volume":"261","author":"R Curticapean","year":"2018","unstructured":"Curticapean, R.: Block interpolation: a framework for tight exponential-time counting complexity. Inf. Comput. 261, 265\u2013280 (2018). https:\/\/doi.org\/10.1016\/j.ic.2018.02.008","journal-title":"Inf. Comput."},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Curticapean, R.: A full complexity dichotomy for immanant families. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1770\u20131783. STOC 2021, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3406325.3451124","DOI":"10.1145\/3406325.3451124"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-14165-2_37","volume-title":"Automata, Languages and Programming","author":"H Dell","year":"2010","unstructured":"Dell, H., Husfeldt, T., Wahl\u00e9n, M.: Exponential time complexity of the permanent and the Tutte Polynomial. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 426\u2013437. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_37"},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1137\/070690201","volume":"38","author":"M Dyer","year":"2009","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: The complexity of weighted Boolean #CSP. SIAM J. Comput. 38(5), 1970\u20131986 (2009). https:\/\/doi.org\/10.1137\/070690201","journal-title":"SIAM J. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Dyer, M.E., Richerby, D.M.: On the complexity of #CSP. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 725\u2013734. STOC 2010, Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1806689.1806789","DOI":"10.1145\/1806689.1806789"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1137\/17M113304X","volume":"47","author":"J Lin","year":"2018","unstructured":"Lin, J., Wang, H.: The complexity of Boolean Holant problems with nonnegative weights. SIAM J. Comput. 47(3), 798\u2013828 (2018). https:\/\/doi.org\/10.1137\/17M113304X","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR19","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). https:\/\/doi.org\/10.1137\/S0097539797321602","journal-title":"SIAM J. Comput."},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979). https:\/\/doi.org\/10.1137\/0208032","DOI":"10.1137\/0208032"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189\u2013201 (1979). https:\/\/doi.org\/10.1016\/0304-3975(79)90044-6","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:08:28Z","timestamp":1702026508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}