arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0406085math.NTmath.AG
收藏

有限域上簇的有理点的快速计算

Fast computation of a rational point of a variety over a finite field

Antonio Cafure, Guillermo Matera

摘要:

本文给出了一个概率算法,它计算由约化正则序列定义的有限域上的绝对不可约簇的有理点。它的时间-空间复杂度在域的基数的对数和输入系统的几何不变量(称为其度)中大致是二次的,它总是由系统的Bezout数限制。我们的算法适用于任何特征的域,但要求域的基数大于一个数量,这个数量大约是输入变量度的四次方。

英文摘要:

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system (called its degree), which is always bounded by the Bezout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.

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

↑