arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.03964cs.SCmath.ACmath.AG
收藏

函数域整基计算的复杂性

On the complexity of computing integral bases of function fields

Simon Abelard

摘要:

设$\mathcal{C}$是由方程$f(x,y)=0$给出的平面曲线,其中$f\in K[x][y]$是一元无平方多项式。研究了代数函数域$K(\mathcal{C})$的积分基的计算问题,并给出了三种已知算法的新的复杂性界。对于每个算法,我们研究它的子程序,并在可能的情况下,我们修改或替换它们,以便利用更快的原语。然后,我们结合复杂度的结果,得出每个算法的整体复杂度估计。特别是,我们修改了一个算法,由于Böhm等人。并实现了准最优的运行时间。

英文摘要:

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new complexity bounds for three known algorithms dealing with this problem. For each algorithm, we study its subroutines and, when it is possible, we modify or replace them so as to take advantage of faster primitives. Then, we combine complexity results to derive an overall complexity estimate for each algorithm. In particular, we modify an algorithm due to Böhm et al. and achieve a quasi-optimal runtime.

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

↑