arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.0499cs.CCcs.ITmath.IT
收藏

帮助位在随机和平均情况复杂性中的价值

The Value of Help Bits in Randomized and Average-Case Complexity

Salman Beigi, Omid Etesami, Amin Gohari

摘要:

“帮助位”是关于计算问题的一个或多个实例的一些有限的可信信息,其可以降低解决该一个或多个实例的计算复杂性。在本文中,我们研究的帮助位的随机和平均情况下的复杂性设置的价值。Amir,Beigel,and Gasarch(1990)表明对于常数$k$,如果决策问题的$k$实例可以使用少于$k$位的帮助有效地求解,那么问题是在P/poly中。我们将这一结果扩展到随机计算的设置:我们表明,决策问题是在P/聚,如果使用$\ell$帮助位,$k$实例的问题可以有效地解决的概率大于$2^{\ell-k}$。如果使用少于$k(1 - h(α))$帮助位(其中$h(\cdot)$是二进制熵函数),则同样的结果成立,我们可以以非零概率正确地有效地求解实例的$(1-α)$分数。我们还将这两个结果推广到非常数但对数$k$。然而,在这种情况下,我们没有显示问题在P/poly中,而是显示它满足“$k$ -成员资格可比性”,这是一个已知与使用少于$k$位的帮助来解决$k$实例相关的概念。接下来我们考虑平均情况复杂度的设置:假设当$k$实例独立于特定分布绘制时,我们可以使用一些熵小于$k$的帮助位来解决决策问题的$k$实例。然后,我们可以有效地解决从该分布中提取的实例,其概率优于$1/2$。最后,我们证明了在$k$是超对数的情况下,假设决策问题的$k$ -成员可比性,不能通过“黑盒证明”来证明该问题是P/poly问题。"

英文摘要:

"Help bits" are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or instances. In this paper, we study the value of help bits in the settings of randomized and average-case complexity. Amir, Beigel, and Gasarch (1990) show that for constant $k$, if $k$ instances of a decision problem can be efficiently solved using less than $k$ bits of help, then the problem is in P/poly. We extend this result to the setting of randomized computation: We show that the decision problem is in P/poly if using $\ell$ help bits, $k$ instances of the problem can be efficiently solved with probability greater than $2^{\ell-k}$. The same result holds if using less than $k(1 - h(α))$ help bits (where $h(\cdot)$ is the binary entropy function), we can efficiently solve $(1-α)$ fraction of the instances correctly with non-vanishing probability. We also extend these two results to non-constant but logarithmic $k$. In this case however, instead of showing that the problem is in P/poly we show that it satisfies "$k$-membership comparability," a notion known to be related to solving $k$ instances using less than $k$ bits of help. Next we consider the setting of average-case complexity: Assume that we can solve $k$ instances of a decision problem using some help bits whose entropy is less than $k$ when the $k$ instances are drawn independently from a particular distribution. Then we can efficiently solve an instance drawn from that distribution with probability better than $1/2$. Finally, we show that in the case where $k$ is super-logarithmic, assuming $k$-membership comparability of a decision problem, one cannot prove that the problem is in P/poly by a "black-box proof."

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

↑