arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.13549cs.DS
收藏

自约NP-问题的随机序计数

Random-Order Enumeration for Self-Reducible NP-Problems

Pengyu Chen, Dongjing Miao, Weitian Tong, Zizheng Guo, Jianzhong Li, Zhipeng Cai

摘要:

在大量的数据分析任务中,一个基本且耗时的过程是产生大量的解决方案并将其输入下游处理。各种枚举算法已被开发用于此目的。枚举算法产生问题实例的所有解,而不重复。为了成为解空间的统计上有意义的表示,要求以均匀随机顺序枚举解。本文研究了一类多项式可数($Sr_{NP}^{FP}$)、允许FPTAS($Sr_{NP}^{FPTAS}$)和允许FPRAS($Sr_{NP}^{FPRAS}$)的自约NP问题。基于(几乎)一致生成元的平凡算法实际上是低效的。我们提供了一个新的见解,(几乎)均匀的发电机不是故事的结尾。更有效的算法框架,提出了在这三个层次的问题,以均匀随机顺序枚举的解决方案。(1)对于$Sr_{NP}^{FP}$中的问题,我们给出了一个具有多项式延迟的随机顺序枚举算法(PDREnum);(2)对于$Sr_{NP}^{FPTAS}$中的问题,我们给出了一个具有期望多项式延迟的Las Vegas随机顺序枚举算法(PDLVREnum);(3)对于$Sr_{NP}^{FPRAS}$中的问题,我们设计了一个完全多项式延迟的大西洋城随机顺序枚举算法具有在输入大小和给定错误概率$δ$(FPACREnum)中的预期延迟多项式,其具有至少$1-δ$成为拉斯维加斯随机顺序枚举算法的概率。最后,为了进一步提高随机顺序枚举算法的效率,基于主/从模式,提出了一种具有1.5最优枚举延迟和运行时间的并行化方案,并进行了理论分析。

英文摘要:

In plenty of data analysis tasks, a basic and time-consuming process is to produce a large number of solutions and feed them into downstream processing. Various enumeration algorithms have been developed for this purpose. An enumeration algorithm produces all solutions of a problem instance without repetition. To be a statistically meaningful representation of the solution space, solutions are required to be enumerated in uniformly random order. This paper studies a set of self-reducible NP-problems in three hierarchies, where the problems are polynomially countable ($Sr_{NP}^{FP}$), admit FPTAS ($Sr_{NP}^{FPTAS}$), and admit FPRAS ($Sr_{NP}^{FPRAS}$), respectively. The trivial algorithm based on a (almost) uniform generator is in fact inefficient. We provide a new insight that the (almost) uniform generator is not the end of the story. More efficient algorithmic frameworks are proposed to enumerate solutions in uniformly random order for problems in these three hierarchies. (1) For problems in $Sr_{NP}^{FP}$, we show a random-order enumeration algorithm with polynomial delay (PDREnum); (2) For problems in $Sr_{NP}^{FPTAS}$, we show a Las Vegas random-order enumeration algorithm with expected polynomial delay (PDLVREnum); (3) For problems in $Sr_{NP}^{FPRAS}$, we devise a fully polynomial delay Atlantic City random-order enumeration algorithm with expected delay polynomial in the input size and the given error probability $δ$ (FPACREnum), which has a probability of at least $1-δ$ becoming a Las Vegas random-order enumeration algorithm. Finally, to further improve the efficiency of the random-order enumeration algorithms, based on the master/slave paradigm, we present a parallelization with 1.5-optimal enumeration delay and running time, along with the theoretical analysis.

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

↑