# Enumeration Classes Defined by Circuits

arXiv: https://arxiv.org/abs/2205.00539 · HTML: https://mlsanity.com/paper/2205.00539/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 32 references that are in the map.
- First posted on arXiv 1 May 2022.

## Abstract (arXiv)

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.