论 PosSLP 的困难性
On the Hardness of PosSLP
AI总结:
本文基于 Dutta 等人的多项式根式猜想,证明若 PosSLP 属于 BPP 则 NP 包含于 BPP,给出其首个有条件非平凡下界,并证明 SLP 表示的整数一元多项式实根计数是 #P 难的。
摘要:
问题 PosSLP 涉及判定由给定直线程序计算出的整数是否为正数。由于该问题对数值计算相关复杂性给出了完备刻画,它在计算复杂性领域受到了相当多关注。然而,PosSLP 的非平凡下界仍然未知。本文中,在关于多项式根式复杂性的一个猜想成立的假设下——该猜想由 Dutta、Saxena 和 Sinhababu(STOC'2018)提出——我们证明 PosSLP ∈ BPP 将蕴含 NP ⊆ BPP。我们的证明建立在 Perrucci 和 Sabia(JDA'2005)所证明的既有结论之上:判定由 SLP 计算的一元多项式是否具有实根是 NP 难的。因此,我们给出的 PosSLP 下界代表了在理解该问题复杂性方面的一项重要进展。尽管是有条件的,但它构成了 PosSLP 的第一个非平凡下界。此外,我们还表明,对以直线程序作为输入给出的整数一元多项式的实根进行计数是 #P 难的。
英文摘要:
The problem $\textrm{PosSLP}$ involves determining whether an integer computed by a given straight-line program is positive. This problem has attracted considerable attention within the field of computational complexity as it provides a complete characterization of the complexity associated with numerical computation. However, non-trivial lower bounds for $\textrm{PosSLP}$ remain unknown. In this paper, we demonstrate that $\textrm{PosSLP} \in \textrm{BPP}$ would imply that $\textrm{NP} \subseteq \textrm{BPP}$, under the assumption of a conjecture concerning the complexity of the radical of a polynomial proposed by Dutta, Saxena, and Sinhababu (STOC'2018). Our proof builds upon the established $\textrm{NP}$-hardness of determining if a univariate polynomial computed by an SLP has a real root, as demonstrated by Perrucci and Sabia (JDA'2005). Therefore, our lower bound for $\textrm{PosSLP}$ represents a significant advancement in understanding the complexity of this problem. It constitutes the first non-trivial lower bound for $\textrm{PosSLP}$ , albeit conditionally. Additionally, we show that counting the real roots of an integer univariate polynomial, given as input by a straight-line program, is $\#\textrm{P}$-hard.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。