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

关于二元多项式组求解的复杂性

On the Complexity of Solving a Bivariate Polynomial System

Pavel Emeliyanenko, Michael Sagraloff

摘要:

我们研究了使用最近提出的算法BISOLVE计算二元多项式系统的实解的复杂性。BISOLVE是一种经典的消去法,它首先将系统的解投影到$x$ -和$y$ -轴上,然后从这样导出的候选集合中选择实际解。然而,与类似的算法,BISOLVE不需要对输入的泛型假设,也不需要任何坐标系的变化。此外,来自\cite{bes-bisolve-2011}的大量基准测试证实,该算法的性能大大优于现有技术的方法。在这项工作中,我们表明,对于两个多项式$f,g\in\mathbb{Z}[x,y]$的总程度最多$n$与整数系数的$2^τ$的界限,BISOLVE计算隔离盒系统$f=g=0$使用$\Otilde(n^8τ^{2})$位操作的所有真正的解决方案,从而提高了以前的记录约束的一个因素,至少$n^{2}$。

英文摘要:

We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method which first projects the solutions of a system onto the $x$- and $y$-axes and, then, selects the actual solutions from the so induced candidate set. However, unlike similar algorithms, BISOLVE requires no genericity assumption on the input nor it needs any change of the coordinate system. Furthermore, extensive benchmarks from \cite{bes-bisolve-2011} confirm that the algorithm outperforms state of the art approaches by a large factor. In this work, we show that, for two polynomials $f,g\in\mathbb{Z}[x,y]$ of total degree at most $n$ with integer coefficients bounded by $2^τ$, BISOLVE computes isolating boxes for all real solutions of the system $f=g=0$ using $\Otilde(n^8τ^{2})$ bit operations, thereby improving the previous record bound by a factor of at least $n^{2}$.

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

↑