Enumeration Classes Defined by Circuits - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Enumeration Classes Defined by Circuits

Résumé

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.
Fichier principal
Vignette du fichier
Enum_classes_CSL.pdf (536.6 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04166123 , version 1 (19-07-2023)

Identifiants

Citer

Nadia Creignou, Arnaud Durand, Heribert Vollmer. Enumeration Classes Defined by Circuits. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Aug 2022, Vienne, Austria. pp.38, ⟨10.4230/LIPIcs.MFCS.2022.38⟩. ⟨hal-04166123⟩
1 Consultations
12 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More