论文标题
枚举课程由电路定义
Enumeration Classes Defined by Circuits
论文作者
论文摘要
我们通过使用布尔电路作为枚举者来定义的非常低的类别来完善枚举问题的复杂性格局。我们找到了众所周知的枚举问题，例如，从图理论，灰色代码枚举以及我们的班级满意度中。通过这种方式，我们获得了一个框架，以区分$ \ mathbf {delayp} $中已知的不同问题的复杂性，直到今天，对此无法进行形式的比较方式。
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 $\mathbf{DelayP}$, for which a formal way of comparison was not possible to this day.
