@inproceedings{fb37b2b8ad974430af6d698c444777dd,
title = "Enumeration Classes Defined by Circuits",
abstract = "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 DelayP, for which a formal way of comparison was not possible to this day.",
keywords = "Boolean circuit, Computational complexity, enumeration problem",
author = "Nadia Creignou and Arnaud Durand and Heribert Vollmer",
year = "2022",
month = aug,
day = "22",
doi = "10.48550/arXiv.2205.00539",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Stefan Szeider and Robert Ganian and Alexandra Silva",
booktitle = "47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022",
address = "Germany",
note = "47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022 ; Conference date: 22-08-2022 Through 26-08-2022",
}