Valiant理论中的插值
Interpolation in Valiant's theory
摘要:
我们调查以下问题:如果一个多项式可以评估合理的点多项式时间布尔算法,它有一个多项式大小的算术电路?我们认为这个问题确实很难。否定它确实意味着Valiant定义的代数复杂性类VP和VNP的无常数版本是不同的。积极地讨论这个问题将意味着从布尔复杂性到代数复杂性的转换定理。我们的证明方法依赖于拉格朗日插值和最近的结果连接(布尔)计数层次代数复杂性类。作为一个副产品,我们得到两个额外的结果:(i)常数自由,度无界版本的Valiant的假设,VP和VNP不同意味着度有界的版本。这个结果以前只适用于正特性的场。(ii)如果容易计算的多项式的指数和可以有效地计算,那么指数乘积也是如此。我们指出了这一结果的应用程序的P=NP问题的Blum-Shub-Smale模型的计算领域的复数。
英文摘要:
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult. Answering it negatively would indeed imply that the constant-free versions of the algebraic complexity classes VP and VNP defined by Valiant are different. Answering this question positively would imply a transfer theorem from boolean to algebraic complexity. Our proof method relies on Lagrange interpolation and on recent results connecting the (boolean) counting hierarchy to algebraic complexity classes. As a byproduct we obtain two additional results: (i) The constant-free, degree-unbounded version of Valiant's hypothesis that VP and VNP differ implies the degree-bounded version. This result was previously known to hold for fields of positive characteristic only. (ii) If exponential sums of easy to compute polynomials can be computed efficiently, then the same is true of exponential products. We point out an application of this result to the P=NP problem in the Blum-Shub-Smale model of computation over the field of complex numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。