关于投影法求解零维多项式组的复杂性
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
摘要:
给定一个由n个整数多项式组成的零维多项式系统,我们给出了一个计算该系统所有复解的证明和完备的方法,并给出了一个相应的具有小比特系数的分离线性形式l.为了计算l,我们需要将解沿着O(n)个不同的方向投影到一维中,但没有进一步的代数操作。然后直接从所考虑的投影重建解决方案。第一步是确定性的,而第二步使用随机化,因此是Las-Vegas。我们的方法的理论分析表明,上述两个问题的总成本主要是进行预测的成本。我们还给出了我们的算法的位复杂度的界限,这些算法仅在变量的数量,总程度和输入多项式的位大小方面进行说明。
英文摘要:
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas. The theoretical analysis of our approach shows that the overall cost for the two problems considered above is dominated by the cost of carrying out the projections. We also give bounds on the bit complexity of our algorithms that are exclusively stated in terms of the number of variables, the total degree and the bitsize of the input polynomials.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。