{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T14:15:09Z","timestamp":1764339309662,"version":"3.46.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2025,12,31]]},"abstract":"<jats:p>\n                    We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators. We locate well-known enumeration problems, e.g., from graph theory, Gray code enumeration, and propositional satisfiability in our classes. In this way we obtain a framework to distinguish between the complexity of different problems known to be in\n                    <jats:sans-serif>DelayP<\/jats:sans-serif>\n                    , for which a formal way of comparison was not possible to this day.\n                  <\/jats:p>","DOI":"10.1145\/3746454","type":"journal-article","created":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T05:49:23Z","timestamp":1750916963000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration Classes Defined by Circuits"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6522-6363","authenticated-orcid":false,"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[{"name":"CNRS, LIS, Aix Marseille Universit\u00e9","place":["Marseille, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2976-7259","authenticated-orcid":false,"given":"Arnaud","family":"Durand","sequence":"additional","affiliation":[{"name":"CNRS, IMJ-PRG, Paris Cit\u00e9 University","place":["Paris, France"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9292-1960","authenticated-orcid":false,"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[{"name":"Institute for Theoretical Computer Science, Leibniz University Hanover","place":["Hannover, Germany"]}]}],"member":"320","published-online":{"date-parts":[[2025,11,28]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(89)90036-5"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_18"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90022-D"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385634.3385636"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.06.038"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04943-3"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.MFCS.2022.38"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/377810"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.02.025"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3389130"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/1276920.1276923"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240639X"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0062"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336526"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_19_2","volume-title":"The Art of Computer Programming: Combinatorial Algorithms, Part 1 (1st ed.)","author":"Knuth Donald E.","year":"2011","unstructured":"Donald E. Knuth. 2011. The Art of Computer Programming: Combinatorial Algorithms, Part 1 (1st ed.). Vol. 4A. Addison-Wesley Professional."},{"key":"e_1_3_2_20_2","volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","author":"Kreher Donald L.","year":"1999","unstructured":"Donald L. Kreher and Douglas Robert Stinson. 1999. Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/990518.990519"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2014.13"},{"key":"e_1_3_2_23_2","article-title":"Enumeration complexity","volume":"129","author":"Strozecki Yann","year":"2019","unstructured":"Yann Strozecki. 2019. Enumeration complexity. Bull. EATCS 129 (2019). Retrieved from http:\/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/596\/605","journal-title":"Bull. EATCS"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46583-9_5"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T14:10:16Z","timestamp":1764339016000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,28]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1145\/3746454"],"URL":"https:\/\/doi.org\/10.1145\/3746454","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"type":"print","value":"1942-3454"},{"type":"electronic","value":"1942-3462"}],"subject":[],"published":{"date-parts":[[2025,11,28]]},"assertion":[{"value":"2024-04-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}