License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.38
URN: urn:nbn:de:0030-drops-168364
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16836/
Creignou, Nadia ;
Durand, Arnaud ;
Vollmer, Heribert
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.
BibTeX - Entry
@InProceedings{creignou_et_al:LIPIcs.MFCS.2022.38,
author = {Creignou, Nadia and Durand, Arnaud and Vollmer, Heribert},
title = {{Enumeration Classes Defined by Circuits}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {38:1--38:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16836},
URN = {urn:nbn:de:0030-drops-168364},
doi = {10.4230/LIPIcs.MFCS.2022.38},
annote = {Keywords: Computational complexity, enumeration problem, Boolean circuit}
}
|
Keywords: |
|
Computational complexity, enumeration problem, Boolean circuit |
|
Collection: |
|
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
22.08.2022 |
