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

用多重奇偶计数法求解GF(2)上多项式系统的改进算法

Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting

Itai Dinur

摘要:

我们考虑的问题,找到一个解决方案的多元多项式方程系统的程度$d$在$n$变量在$\mathbb{F}_2$。对于$d=2$,该问题的最著名算法是Bardet等人[J. Complexity,2013],并且在实验发现适用于随机方程系统的假设下,该算法被证明在时间$O(2^{0.792n})$中运行。该问题最著名的最坏情况算法是由Björklund等人[ICALP'19]提出的。它在时间上运行$O(2^{0.804n})$用于$d = 2$和$O(2^{(1 - 1/(2.7d))n})$用于$d > 2$。在本文中,我们设计了一个最坏情况下的算法,改进了Björklund等人的算法。它运行在时间$O(2^{0.6943n})$(或$O(1.6181^n)$)的$d = 2$和$O(2^{(1 - 1/(2d))n})$的$d > 2$。因此,我们的算法优于所有已知的最坏情况下的算法,以及随机方程系统的分析。我们还设计了第二个算法,输出的所有解决方案的多项式系统,并具有类似的复杂性的第一(提供的解决方案的数量不是太大)。一个中心思想在工作的比约克隆德等人。是减少问题的解决方案,一个多项式系统超过$\mathbb{F}_2$的问题,计数的奇偶性的所有解决方案。一个奇偶计数实例然后被减少到许多更小的奇偶计数实例。我们的主要观察是,这些较小的实例相关,可以更有效地解决一个问题,我们称之为多奇偶计数的新算法。

英文摘要:

We consider the problem of finding a solution to a multivariate polynomial equation system of degree $d$ in $n$ variables over $\mathbb{F}_2$. For $d=2$, the best-known algorithm for the problem is by Bardet et al. [J. Complexity, 2013] and was shown to run in time $O(2^{0.792n})$ under assumptions that were experimentally found to hold for random equation systems. The best-known worst-case algorithm for the problem is due to Björklund et al. [ICALP'19]. It runs in time $O(2^{0.804n})$ for $d = 2$ and $O(2^{(1 - 1/(2.7d))n})$ for $d > 2$. In this paper, we devise a worst-case algorithm that improves the one by Björklund et al. It runs in time $O(2^{0.6943n})$ (or $O(1.6181^n)$) for $d = 2$ and $O(2^{(1 - 1/(2d))n})$ for $d > 2$. Our algorithm thus outperforms all known worst-case algorithms, as well as ones analyzed for random equation systems. We also devise a second algorithm that outputs all solutions to a polynomial system and has similar complexity to the first (provided that the number of solutions is not too large). A central idea in the work of Björklund et al. was to reduce the problem of finding a solution to a polynomial system over $\mathbb{F}_2$ to the problem of counting the parity of all solutions. A parity-counting instance was then reduced to many smaller parity-counting instances. Our main observation is that these smaller instances are related and can be solved more efficiently by a new algorithm to a problem which we call multiple parity-counting.

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

↑