{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:01Z","timestamp":1767339961919,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592660"},{"type":"electronic","value":"9783030592677"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-59267-7_22","type":"book-chapter","created":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T19:02:33Z","timestamp":1602442953000},"page":"251-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Characterizations and Approximability of\u00a0Hard Counting Classes Below $$\\#\\mathsf {P}$$"],"prefix":"10.1007","author":[{"given":"Eleni","family":"Bakali","sequence":"first","affiliation":[]},{"given":"Aggeliki","family":"Chalki","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 160(2), 781\u2013793 (2004). https:\/\/doi.org\/10.4007\/annals.2004.160.781","journal-title":"Ann. Math."},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Arenas, M., Croquevielle, L.A., Jayaram, R., Riveros, C.: Efficient logspace classes for enumeration, counting, and uniform generation. CoRR abs\/1906.09226 (2019). https:\/\/doi.org\/10.1145\/3294052.3319704. http:\/\/arxiv.org\/abs\/1906.09226","DOI":"10.1145\/3294052.3319704"},{"key":"22_CR3","unstructured":"Arenas, M., Mu\u00f1oz, M., Riveros, C.: Descriptive complexity for counting complexity classes. CoRR abs\/1805.02724 (2018). http:\/\/arxiv.org\/abs\/1805.02724"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-57586-5_6","volume-title":"Algorithms and Complexity","author":"E Bakali","year":"2017","unstructured":"Bakali, E., Chalki, A., Pagourtzis, A., Pantavos, P., Zachos, S.: Completeness results for counting problems with easy decision. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 55\u201366. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_6"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00037-016-0137-8","volume":"26","author":"E Bampas","year":"2017","unstructured":"Bampas, E., G\u00f6bel, A., Pagourtzis, A., Tentes, A.: On the connection between interval size functions and path counting. Comput. Complex. 26(2), 421\u2013467 (2017). https:\/\/doi.org\/10.1007\/s00037-016-0137-8","journal-title":"Comput. Complex."},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Bulatov, A., Dalmau, V., Thurley, M.: Descriptive complexity of approximate counting CSPs. In: Rocca, S.R.D. (ed.) Computer Science Logic 2013 (CSL 2013). LIPIcs, vol. 23, pp. 149\u2013164. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2013). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.149. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4195","DOI":"10.4230\/LIPIcs.CSL.2013.149"},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Dalmau, V.: Linear datalog and bounded path duality of relational structures. Log. Methods Comput. Sci. 1(1) (2005). https:\/\/doi.org\/10.2168\/LMCS-1(1:5)2005. https:\/\/lmcs.episciences.org\/2275","DOI":"10.2168\/LMCS-1(1:5)2005"},{"issue":"5","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/S0097539701383844","volume":"31","author":"M Dyer","year":"2002","unstructured":"Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. SIAM J. Comput. 31(5), 1527\u20131541 (2002). https:\/\/doi.org\/10.1137\/S0097539701383844","journal-title":"SIAM J. Comput."},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00453-003-1073-y","volume":"38","author":"ME Dyer","year":"2004","unstructured":"Dyer, M.E., Goldberg, L.A., Greenhill, C.S., Jerrum, M.: The relative complexity of approximate counting problems. Algorithmica 38(3), 471\u2013500 (2004). https:\/\/doi.org\/10.1007\/s00453-003-1073-y","journal-title":"Algorithmica"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Galanis, A., Goldberg, L.A., Jerrum, M.: A complexity trichotomy for approximately counting list H-colorings. ACM Trans. Comput. Theory 9(2) (2017). https:\/\/doi.org\/10.1145\/3037381","DOI":"10.1145\/3037381"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/020604910.1137\/0206049","volume":"6","author":"J Gill","year":"1977","unstructured":"Gill, J.: Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6(4), 675\u2013695 (1977). https:\/\/doi.org\/10.1137\/020604910.1137\/0206049","journal-title":"SIAM J. Comput."},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1137\/S0097539705447013","volume":"36","author":"LA Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, L.A., Homan, C.M., Kosub, S., Wagner, K.W.: The complexity of computing the size of an interval. SIAM J. Comput. 36(5), 1264\u20131300 (2007). https:\/\/doi.org\/10.1137\/S0097539705447013","journal-title":"SIAM J. Comput."},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Jerrum, M., Sinclair, A.: The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration, pp. 482\u2013520. PWS Publishing Co., USA (1996) https:\/\/doi.org\/10.1145\/261342.571216","DOI":"10.1145\/261342.571216"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"RM Karp","year":"1989","unstructured":"Karp, R.M., Luby, M., Madras, N.: Monte-Carlo approximation algorithms for enumeration problems. J. Algorithms 10(3), 429\u2013448 (1989). https:\/\/doi.org\/10.1016\/0196-6774(89)90038-2. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0196677489900382","journal-title":"J. Algorithms"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105\u2013113 (1987). https:\/\/doi.org\/10.1007\/BF02579206","journal-title":"Combinatorica"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-540-74456-6_63","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C Nomikos","year":"2007","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Randomized and approximation algorithms for blue-red matching. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 715\u2013725. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74456-6_63"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/11821069_64","volume-title":"Mathematical Foundations of Computer Science 2006","author":"A Pagourtzis","year":"2006","unstructured":"Pagourtzis, A., Zachos, S.: The complexity of counting functions with easy decision version. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 741\u2013752. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_64"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/3-540-09510-1_36","volume-title":"Automata, Languages and Programming","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted minimum spanning tree problems (extended abstract). In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 460\u2013470. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09510-1_36"},{"issue":"3","key":"22_CR19","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1006\/jcss.1995.1039","volume":"50","author":"S Saluja","year":"1995","unstructured":"Saluja, S., Subrahmanyam, K., Thakur, M.: Descriptive complexity of #P functions. J. Comput. Syst. Sci. 50(3), 493\u2013505 (1995). https:\/\/doi.org\/10.1006\/jcss.1995.1039. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000085710392","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82(1), 93\u2013133 (1989). https:\/\/doi.org\/10.1016\/0890-5401(89)90067-9. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0890540189900679","journal-title":"Inf. Comput."},{"issue":"2","key":"22_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. Theor. Comput. Sci. 8(2), 189\u2013201 (1979). https:\/\/doi.org\/10.1016\/0304-3975(79)90044-6. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397579900446","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59267-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:09:53Z","timestamp":1710353393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59267-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592660","9783030592677"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59267-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tamc2020.csu.edu.cn\/","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":"83","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":"37","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":"45% - 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":"7","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.","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)"}}]}}