由电路定义的枚举类
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。