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

$\text{#NFA}$承认一个FPRAS:日志空间类的有效枚举、计数和统一生成

$\text{#NFA}$ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes

Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros

摘要:

在这项工作中,我们研究了两个简单而又通用的复杂性类,基于对数空间图灵机,它提供了一个统一的框架,有效的查询评估领域,如信息抽取和图形数据库等。我们调查这些类的三个基本算法问题的复杂性:枚举,计数和统一生成的解决方案,并表明,他们在这方面有几个理想的属性。这两个复杂性类别都是根据非确定性对数空间换能器(NL换能器)定义的。对于第一类,我们考虑的情况下,明确的NL传感器,我们证明了常数延迟枚举,计数和统一生成的解决方案在多项式时间。对于第二类,我们考虑不受限制的NL传感器,我们得到多项式延迟枚举,近似计数多项式时间,和多项式时间的随机算法均匀生成。更具体地说,我们表明,在这第二类中的每个问题承认一个完全多项式时间随机近似方案(FPRAS)和多项式时间拉斯维加斯算法的均匀生成。有趣的是,证明这些结果的关键思想是证明基本问题$\text{#NFA}$允许FPRAS,其中$\text{#NFA}$是计算长度为$n$(以一元形式给出)的字符串的数量的问题,该字符串被非确定性有限自动机(NFA)接受。虽然这个问题是已知的$\text{#P}$ -完全的,更准确地说,是$\text{SpanL}$ -完全的,但这个问题是否允许FPRAS是开放的。在这项工作中,我们解决了这个开放的问题,并获得了一个可喜的推论,在$\text{SpanL}$的每个功能承认FPRAS。

英文摘要:

In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeration, counting and uniform generation of solutions, and show that they have several desirable properties in this respect. Both complexity classes are defined in terms of non-deterministic logspace transducers (NL transducers). For the first class, we consider the case of unambiguous NL transducers, and we prove constant delay enumeration, and both counting and uniform generation of solutions in polynomial time. For the second class, we consider unrestricted NL transducers, and we obtain polynomial delay enumeration, approximate counting in polynomial time, and polynomial-time randomized algorithms for uniform generation. More specifically, we show that each problem in this second class admits a fully polynomial-time randomized approximation scheme (FPRAS) and a polynomial-time Las Vegas algorithm for uniform generation. Interestingly, the key idea to prove these results is to show that the fundamental problem $\text{#NFA}$ admits an FPRAS, where $\text{#NFA}$ is the problem of counting the number of strings of length $n$ (given in unary) accepted by a non-deterministic finite automaton (NFA). While this problem is known to be $\text{#P}$-complete and, more precisely, $\text{SpanL}$-complete, it was open whether this problem admits an FPRAS. In this work, we solve this open problem, and obtain as a welcome corollary that every function in $\text{SpanL}$ admits an FPRAS.

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

↑