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

环面多项式:求ACC下界的代数方法

Torus polynomials: an algebraic approach to ACC lower bounds

Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao

摘要:

我们提出了一个代数方法来证明电路下界ACC 0的定义和研究的概念环面多项式。我们展示了如何在这个框架中重新表达AC 0和ACC 0的当前已知的基于多项式的逼近结果,这意味着ACC 0可以用低次环面多项式逼近。此外,作为证明ACC0下界的多数函数通过我们的方法的一步,我们表明,MAJORITY不能近似低次对称环面多项式。我们还提出了几个开放的问题与我们的框架。

英文摘要:

We propose an algebraic approach to proving circuit lower bounds for ACC0 by defining and studying the notion of torus polynomials. We show how currently known polynomial-based approximation results for AC0 and ACC0 can be reformulated in this framework, implying that ACC0 can be approximated by low-degree torus polynomials. Furthermore, as a step towards proving ACC0 lower bounds for the majority function via our approach, we show that MAJORITY cannot be approximated by low-degree symmetric torus polynomials. We also pose several open problems related to our framework.

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

↑