{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:14:23Z","timestamp":1725880463839},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_13","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"183-195","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Hard Enumeration Problems"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Markus","family":"Kr\u00f6ll","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"Pichler","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Skritek","sequence":"additional","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"13_CR1","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, Cambridge (2009)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-74915-8_18","volume-title":"Computer Science Logic","author":"G Bagan","year":"2007","unstructured":"Bagan, G., Durand, A., Grandjean, E.: On acyclic conjunctive queries and constant delay enumeration. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 208\u2013222. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74915-8_18"},{"key":"13_CR3","unstructured":"Brault-Baron, J.: De la pertinence de l\u2019\u00e9num\u00e9ration : complexit\u00e9 en logiques propositionnelle et du premier ordre. (The relevance of the list: propositional logic and complexity of the first order). Ph.D. thesis, University of Caen Normandy, France (2013). https:\/\/tel.archives-ouvertes.fr\/tel-01081392"},{"issue":"6","key":"13_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1051\/ita\/1997310604991","volume":"31","author":"N Creignou","year":"1997","unstructured":"Creignou, N., H\u00e9brard, J.J.: On generating all solutions of generalized satisfiability problems. Informatique Th\u00e9orique et Applications 31(6), 499\u2013511 (1997)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"13_CR5","unstructured":"Creignou, N., Kr\u00f6ll, M., Pichler, R., Skritek, S., Vollmer, H.: On the complexity of hard enumeration problems. CoRR abs\/1610.05493 (2016), http:\/\/arxiv.org\/abs\/1610.05493"},{"issue":"4","key":"13_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2015-1159","volume":"136","author":"N Creignou","year":"2015","unstructured":"Creignou, N., Vollmer, H.: Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting. Fundam. Inform. 136(4), 297\u2013316 (2015). http:\/\/dx.doi.org\/10.3233\/FI-2015-1159","journal-title":"Fundam. Inform."},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"21\/1","DOI":"10.1145\/1276920.1276923","volume":"8","author":"A Durand","year":"2007","unstructured":"Durand, A., Grandjean, E.: First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log. 8(4), 21\/1\u201321\/19 (2007). http:\/\/doi.acm.org\/10.1145\/1276920.1276923","journal-title":"ACM Trans. Comput. Log."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.tcs.2005.03.012","volume":"340","author":"A Durand","year":"2005","unstructured":"Durand, A., Hermann, M., Kolaitis, P.G.: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3), 496\u2013513 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Durand, A., Schweikardt, N., Segoufin, L.: Enumerating answers to first-order queries over databases of low degree. In: Proceedings of PODS 2014, pp. 121\u2013131. ACM (2014)","DOI":"10.1145\/2594538.2594539"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42(1), 3\u201342 (1995)","journal-title":"J. ACM"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Hemachandra, L.A.: The strong exponential hierarchy collapses. In: Proceedings of STOC 1987, pp. 110\u2013122. ACM (1987)","DOI":"10.1145\/28395.28408"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/203610.203611","volume":"26","author":"LA Hemaspaandra","year":"1995","unstructured":"Hemaspaandra, L.A., Vollmer, H.: The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1), 2\u201313 (1995)","journal-title":"SIGACT News"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2629550","volume":"39","author":"B Kimelfeld","year":"2014","unstructured":"Kimelfeld, B., Kolaitis, P.G.: The complexity of mining maximal frequent subgraphs. ACM Trans. Database Syst. 39(4), 32:1\u201332:33 (2014). http:\/\/doi.acm.org\/10.1145\/2629550","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(78)90009-0","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Osborn, S.L.: Candidate keys for relations. J. Comput. Syst. Sci. 17(2), 270\u2013279 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216\u2013226. ACM Press (1978)","DOI":"10.1145\/800133.804350"},{"key":"13_CR17","unstructured":"Strozecki, Y.: Enumeration complexity and matroid decomposition. Ph.D. thesis, Universite Paris Diderot - Paris 7, December 2010. http:\/\/www.prism.uvsq.fr\/~ ystr\/these_strozecki"},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/s00224-012-9442-z","volume":"53","author":"Y Strozecki","year":"2013","unstructured":"Strozecki, Y.: On enumerating monomials and other combinatorial structures by polynomial interpolation. Theory Comput. Syst. 53(4), 532\u2013568 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"13_CR19","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T08:28:50Z","timestamp":1601627330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-319-53733-7_13","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":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}
