{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T04:04:50Z","timestamp":1750737890403,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","funder":[{"name":"National Key R&D Program of China","award":["2023YFA1009500"],"award-info":[{"award-number":["2023YFA1009500"]}]},{"name":"NSFC","award":["61932002, 62272448"],"award-info":[{"award-number":["61932002, 62272448"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718135","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"1795-1806","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The FP\u1d3a\u1d3e versus #P Dichotomy for #EO"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0088-1639","authenticated-orcid":false,"given":"Boning","family":"Meng","sequence":"first","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9801-271X","authenticated-orcid":false,"given":"Juqiu","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3868-9910","authenticated-orcid":false,"given":"Mingji","family":"Xia","sequence":"additional","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"volume-title":"Computational complexity: a modern approach","author":"Arora Sanjeev","key":"e_1_3_2_1_1_1","unstructured":"Sanjeev Arora and Boaz Barak. 2009. Computational complexity: a modern approach. Cambridge University Press. isbn:978-0-521-42426-4 http:\/\/www.cambridge.org\/catalogue\/catalogue.asp?isbn=9780521424264"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Alexei Borodin Alexey Bufetov and Michael Wheeler. 2016. Between the stochastic six vertex model and Hall-Littlewood processes. arXiv preprint arXiv:1611.09486.","DOI":"10.1215\/00127094-3166843"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Alexei Borodin Ivan Corwin and Vadim Gorin. 2016. Stochastic six-vertex model.","DOI":"10.1215\/00127094-3166843"},{"volume-title":"Proofs and confirmations: the story of the alternating-sign matrix conjecture","author":"Bressoud David M","key":"e_1_3_2_1_5_1","unstructured":"David M Bressoud. 1999. Proofs and confirmations: the story of the alternating-sign matrix conjecture. Cambridge University Press."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488687"},{"volume-title":"Complexity dichotomies for counting problems","author":"Cai Jin-Yi","key":"e_1_3_2_1_7_1","unstructured":"Jin-Yi Cai and Xi Chen. 2017. Complexity dichotomies for counting problems: Volume 1, Boolean domain. Cambridge University Press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105064"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104589"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.01.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536511"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104445009"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01212176"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1155\/S1073792896000128"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.162.162"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M113304X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Boning Meng Juqiu Wang and Mingji Xia. 2024. P-time algorithms for typical #EO problems. arXiv preprint arXiv:2410.11557 https:\/\/doi.org\/10.48550\/arXiv.2410.11557 10.48550\/arXiv.2410.11557","DOI":"10.48550\/arXiv.2410.11557"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Boning Meng Juqiu Wang and Mingji Xia. 2025. The FP^ NP versus #P dichotomy for #EO. arXiv preprint arXiv:2502.02012 https:\/\/doi.org\/10.48550\/arXiv.2502.02012 10.48550\/arXiv.2502.02012","DOI":"10.48550\/arXiv.2502.02012"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90068-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2017.07.003"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1021\/ja01315a102"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"e_1_3_2_1_24_1","first-page":"5","article-title":"\u00dcber ein zweidimensionales klassisches Konfigurationsmodell","volume":"36","author":"Rys Franz","year":"1963","unstructured":"Franz Rys. 1963. \u00dcber ein zweidimensionales klassisches Konfigurationsmodell. Helvetica Physica Acta, 36, 5, 537.","journal-title":"Helvetica Physica Acta"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00105"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2025.86"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1750821"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.37236\/1271"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:39:53Z","timestamp":1750693193000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":28,"alternative-id":["10.1145\/3717823.3718135","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718135","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}