arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.01140cs.SCmath.NT
收藏

计算代数数域所有子域的复杂性

The Complexity of Computing all Subfields of an Algebraic Number Field

Jonas Szutkoski, Mark van Hoeij

摘要:

对于有限可分域扩张K/k,所有子域都可以通过相交K/k的所谓主子域来获得。在这项工作中,我们提出了一种方法来快速计算这些交点。如果子场的数量高,则这导致更快的运行时间和改进的复杂性。

英文摘要:

For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity.

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

↑