arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.01928cs.CC
收藏

论枚举的复杂性

On The Complexity of Enumeration

Florent Capelli, Yann Strozecki

摘要:

我们调查了几个枚举复杂性类之间的关系,特别是集中在具有增量和多项式延迟(IncP和DelayP分别)的枚举算法的问题。我们表明,对于某些算法,我们可以把一个平均延迟到最坏情况下的延迟,而不增加的空间复杂度,这表明IncP_1 = DelayP,即使与多项式有界的空间。我们使用的指数时间假设,表现出严格的层次结构内IncP的第一个分离的DelayP和IncP。最后,我们将解的一致生成与具有多项式延迟和多项式空间的概率枚举算法联系起来。

英文摘要:

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some algorithms, we can turn an average delay into a worst case delay without increasing the space complexity, suggesting that IncP_1 = DelayP even with polynomially bounded space. We use the Exponential Time Hypothesis to exhibit a strict hierarchy inside IncP which gives the first separation of DelayP and IncP. Finally we relate the uniform generation of solutions to probabilistic enumeration algorithms with polynomial delay and polynomial space.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑