更快地枚举DNF的模型:打破对公式规模的依赖
Enumerating models of DNF faster: breaking the dependency on the formula size
AI总结:
本文研究DNF公式模型枚举问题,提出延迟仅依赖模型规模而非公式规模的算法,为固定k-DNF和单调公式分别提供了常数和二次延迟算法,并进一步实现次线性平均延迟。
摘要:
本文研究枚举DNF公式模型的问题。目标是提供枚举算法,其延迟多项式地依赖于每个模型的规模,而非公式规模,后者可能呈指数级增大。对于DNF公式的两个子类我们取得了成功:通过适当的摊销方法,为固定的$k$-DNF提供了常数延迟算法,并为单调公式给出了二次延迟算法。随后,我们关注枚举算法的平均延迟,并展示了如何获得关于公式规模的次线性延迟。
英文摘要:
In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of each model and not on the size of the formula, which can be exponentially larger. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for $k$-DNF with fixed $k$ by an appropriate amortization method and we give a quadratic delay algorithm for monotone formulas. We then focus on the \emph{average delay} of enumeration algorithms and show how to obtain a sublinear delay in the formula size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。