arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.5042cs.SCcs.CG
收藏

二元系统的有理单变量表示及其应用

Rational Univariate Representations of Bivariate Systems and Applications

Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier

摘要:

我们解决的问题,解决系统的两个二元多项式的总次数至多$d$与整数系数的最大位大小$τ$。众所周知,线性分离形式,即在系统的不同解处取不同值的变量的线性组合,可以在$\sOB(d^{8}+d^7τ)$位运算中计算(其中$O_B$指位复杂度,$\sO$指省略多对数因子的复杂度),并且我们在这里关注给定线性分离形式的有理单变量表示(RUR)的计算。我们提出了一种算法,用于计算RUR的最坏情况下的比特复杂度在$\sOB(d^7+d^6τ)$和限制其系数的比特大小由$\sO(d^2+dτ)$。此外,我们表明,隔离盒的解决方案的系统可以计算从RUR与$\sOB(d^{8}+d^7τ)$位操作。最后,我们展示了如何一个RUR可以被用来评估一个二元多项式的符号(度最多$d$和位大小最多$τ$)在一个真正的解决方案的系统中的$\sOB(d^{8}+d^7τ)$位操作和所有的$Θ(d^2)$ {真正}的解决方案,只有$O(d)$倍,为一个解决方案。

英文摘要:

We address the problem of solving systems of two bivariate polynomials of total degree at most $d$ with integer coefficients of maximum bitsize $τ$. It is known that a linear separating form, that is a linear combination of the variables that takes different values at distinct solutions of the system, can be computed in $\sOB(d^{8}+d^7τ)$ bit operations (where $O_B$ refers to bit complexities and $\sO$ to complexities where polylogarithmic factors are omitted) and we focus here on the computation of a Rational Univariate Representation (RUR) given a linear separating form. We present an algorithm for computing a RUR with worst-case bit complexity in $\sOB(d^7+d^6τ)$ and bound the bitsize of its coefficients by $\sO(d^2+dτ)$. We show in addition that isolating boxes of the solutions of the system can be computed from the RUR with $\sOB(d^{8}+d^7τ)$ bit operations. Finally, we show how a RUR can be used to evaluate the sign of a bivariate polynomial (of degree at most $d$ and bitsize at most $τ$) at one real solution of the system in $\sOB(d^{8}+d^7τ)$ bit operations and at all the $Θ(d^2)$ {real} solutions in only $O(d)$ times that for one solution.

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

↑