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

小模的二次多项式不能表示OR

Quadratic polynomials of small modulus cannot represent OR

Holden Lee

摘要:

复杂性理论中的一个公开问题是找到表示$n$位OR函数模复合$m$的多项式的最小次数。这个问题与理解具有$\text{MOD}_m$门的电路的功率有关,其中$m$是复合的。OR函数特别令人感兴趣,因为它是最简单的函数,不受通信复杂性的限制。Tardos和Barrington建立了$Ω((\log n)^{O_m(1)})$的下限,Barrington、Beigel和Rudich建立了$n^{O_m(1)}$的上限。二十年来,在缩小这一差距方面没有取得任何进展,而要取得进展,可能需要新的技术。从不同的角度来看,我们在这个问题上取得了进展:而不是固定的模数$m$和约束的最小程度$d$的变量$n$的数量,我们固定的程度$d$和约束$n$的模数$m$。对于次数$d=2$,我们证明了$n\le m^{O(d)}\le m^{O(\log m)}$的一个拟多项式界,改进了Tardos和Barrington的一般界所隐含的$2^{O(m)}$的最佳界.为了理解二次多项式模$m$的计算能力,我们引入了一定的二分法,这可能是独立的利益。也就是说,我们定义了二次多项式$f$的布尔秩的概念,并将其与对角刚性的概念联系起来。利用加法组合,我们表明,当秩低,$f(\mathbf x)=0$必须有许多解决方案。使用指数和的技术,我们表明,当$f$的秩高,$f$接近等分布。在任何一种情况下,$f$都不能在许多变量中表示OR函数。

英文摘要:

An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$ is composite. The OR function is of particular interest because it is the simplest function not amenable to bounds from communication complexity. Tardos and Barrington established a lower bound of $Ω((\log n)^{O_m(1)})$, and Barrington, Beigel, and Rudich established an upper bound of $n^{O_m(1)}$. No progress has been made on closing this gap for twenty years, and progress will likely require new techniques. We make progress on this question viewed from a different perspective: rather than fixing the modulus $m$ and bounding the minimum degree $d$ in terms of the number of variables $n$, we fix the degree $d$ and bound $n$ in terms of the modulus $m$. For degree $d=2$, we prove a quasipolynomial bound of $n\le m^{O(d)}\le m^{O(\log m)}$, improving the previous best bound of $2^{O(m)}$ implied by Tardos and Barrington's general bound. To understand the computational power of quadratic polynomials modulo $m$, we introduce a certain dichotomy which may be of independent interest. Namely, we define a notion of boolean rank of a quadratic polynomial $f$ and relate it to the notion of diagonal rigidity. Using additive combinatorics, we show that when the rank is low, $f(\mathbf x)=0$ must have many solutions. Using techniques from exponential sums, we show that when the rank of $f$ is high, $f$ is close to equidistributed. In either case, $f$ cannot represent the OR function in many variables.

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

↑