arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0207009cs.CCcs.DMcs.DS
收藏

用次线性乘法计算初等对称多项式

Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications

Vince Grolmusz

摘要:

初等对称多项式$S_n^k$被用作有界深度算术电路计算模型的基准。在这项工作中,我们证明了$S_n^k$模复合数$m=p_1p_2$可以计算少得多的乘法比在任何领域,如果单项式$x_{i_1}x_{i_2}... x_{i_k}$的系数被允许为1要么mod $p_1$或mod $p_2$,但不一定两者兼而有之。更确切地说,我们证明,对于任何恒定的$k$这样的表示$S_n^k$可以计算模$p_1p_2$仅使用$\exp(O(\sqrt{\log n}\log\log n))$乘法的最受限制的深度3算术电路,为$\min({p_1,p_2})>k!$。此外,乘法的数量保持次线性,而$k=O(\log\log n).$相反,众所周知的Graham-Pollack界产生的乘法的数量的$n-1$下限,即使对于$S_n^2$的精确计算(而不是表示)。我们的结果也推广到其他非素幂复合模。证明使用著名的BBR多项式的巴林顿,贝格尔和Rudich。

英文摘要:

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer multiplications than over any field, if the coefficients of monomials $x_{i_1}x_{i_2}... x_{i_k}$ are allowed to be 1 either mod $p_1$ or mod $p_2$ but not necessarily both. More exactly, we prove that for any constant $k$ such a representation of $S_n^k$ can be computed modulo $p_1p_2$ using only $\exp(O(\sqrt{\log n}\log\log n))$ multiplications on the most restricted depth-3 arithmetic circuits, for $\min({p_1,p_2})>k!$. Moreover, the number of multiplications remain sublinear while $k=O(\log\log n).$ In contrast, the well-known Graham-Pollack bound yields an $n-1$ lower bound for the number of multiplications even for the exact computation (not the representation) of $S_n^2$. Our results generalize for other non-prime power composite moduli as well. The proof uses the famous BBR-polynomial of Barrington, Beigel and Rudich.

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

↑