{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:23:02Z","timestamp":1725884582509},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_6","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"55-66","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Completeness Results for Counting Problems with Easy Decision"],"prefix":"10.1007","author":[{"given":"Eleni","family":"Bakali","sequence":"first","affiliation":[]},{"given":"Aggeliki","family":"Chalki","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6220-3722","authenticated-orcid":false,"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Petros","family":"Pantavos","sequence":"additional","affiliation":[]},{"given":"Stathis","family":"Zachos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"6_CR1","first-page":"245","volume-title":"Handbook of Satisfiability","author":"D Achlioptas","year":"2009","unstructured":"Achlioptas, D.: Random Satisfiability. In: Biere, A., et al. (eds.) Handbook of Satisfiability, pp. 245\u2013270. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/rsa.20323","volume":"38","author":"D Achlioptas","year":"2011","unstructured":"Achlioptas, D., Coja-Oghlan, A., Ricci-Tersenghi, F.: On the solution-space geometry of random constraint satisfaction problems. Random Struct. Algorithms 38(3), 251\u2013268 (2011)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1137\/070680382","volume":"39","author":"D Achlioptas","year":"2009","unstructured":"Achlioptas, D., Ricci-Tersenghi, F.: Random formulas have frozen variables. SIAM J. Comput. 39(1), 260\u2013280 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C \u00c0lvarez","year":"1993","unstructured":"\u00c0lvarez, C., Jenner, B.: A very hard log-space counting class. Theoret. Comput. Sci. 107(1), 3\u201330 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)"},{"key":"6_CR6","unstructured":"Bakali, E.: Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds. CoRR abs\/1611.01706 (2016)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bampas, E., Gobel, A., Pagourtzis, A., Tentes, A.: On the connection between interval size functions and path counting. Comput. Complex., 1\u201347 (2016). doi:10.1007\/s00037-016-0137-8. Springer","DOI":"10.1007\/s00037-016-0137-8"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Dyer, M.: Approximate counting by dynamic programming. In: Proceedings of 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 693\u2013699 (2003)","DOI":"10.1145\/780542.780643"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00453-003-1073-y","volume":"38","author":"ME Dyer","year":"2003","unstructured":"Dyer, M.E., Goldberg, L.A., Greenhill, C.S., Jerrum, M.: The relative complexity of approximate counting problems. Algorithmica 38(3), 471\u2013500 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1137\/15M1020551","volume":"45","author":"A Galanis","year":"2016","unstructured":"Galanis, A., Goldberg, L.A., Jerrum, M.: Approximately counting H-colourings is $$\\#$$BIS-hard. SIAM J. Comput. 45(3), 680\u2013711 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1017\/S096354830600767X","volume":"16","author":"LA Goldberg","year":"2007","unstructured":"Goldberg, L.A., Jerrum, M.: The complexity of ferromagnetic ising with local fields. Comb. Probab. Comput. 16(1), 43\u201361 (2007)","journal-title":"Comb. Probab. Comput."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Gopalan, P., Klivans, A., Meka, R., \u0160tefankovi\u010d, D., Vempala, S., Vigoda, E.: An FPTAS for $$\\#$$knapsack and related counting problems. In: Proceedings of 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 817\u2013826 (2011)","DOI":"10.1109\/FOCS.2011.32"},{"issue":"5","key":"6_CR13","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)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","first-page":"482","volume-title":"Approximation Algorithms for NP-hard Problems","author":"M Jerrum","year":"1996","unstructured":"Jerrum, M., Sinclair, A.: The Markov chain Monte Carlo method: an approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, pp. 482\u2013520. PWS, Boston (1996)"},{"issue":"3","key":"6_CR15","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)","journal-title":"J. Algorithms"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-38076-0_29","volume-title":"Advances in Informatics","author":"A Kiayias","year":"2003","unstructured":"Kiayias, A., Pagourtzis, A., Sharma, K., Zachos, S.: Acceptor-definable counting classes. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds.) PCI 2001. LNCS, vol. 2563, pp. 453\u2013463. Springer, Heidelberg (2003). doi:10.1007\/3-540-38076-0_29"},{"key":"6_CR17","unstructured":"Kiayias, A., Pagourtzis, A., Zachos, S.: Cook reductions blur structural differences between functional complexity classes. In: Proceedings of 2nd Panhellenic Logic Symposium, pp. 132\u2013137 (1999)"},{"issue":"129","key":"6_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 121\u2013136 (1975)","journal-title":"Math. Comput."},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00276023","volume":"26","author":"J K\u00f6bler","year":"1989","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Toran, J.: On counting and approximation. Acta Inform. 26, 363\u2013379 (1989)","journal-title":"Acta Inform."},{"key":"6_CR20","unstructured":"Pagourtzis, A.: On the complexity of hard counting problems with easy decision version. In: Proceedings of 3rd Panhellenic Logic Symposium, Anogia, Crete (2001)"},{"key":"6_CR21","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). doi:10.1007\/11821069_64"},{"key":"6_CR22","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"issue":"3","key":"6_CR23","first-page":"169","volume":"50","author":"S Saluja","year":"1992","unstructured":"Saluja, S., Subrahmanyam, K.V., Thakur, M.: Descriptive complexity of #P functions. J. Comput. Syst. Sci. 50(3), 169\u2013184 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"AJ Sinclair","year":"1989","unstructured":"Sinclair, A.J., Jerrum, M.R.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82, 93\u2013133 (1989)","journal-title":"Inf. Comput."},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:47:26Z","timestamp":1710341246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}