计算Hilbert类多项式
Computing Hilbert Class Polynomials
摘要:
我们提出并分析了计算Hilbert类多项式$H_D$的两种算法。第一个是惰性素数p的p-adic提升算法,其顺序为判别式D < 0。第二种是利用类群作用于有限域上CM-曲线的改进的中国剩余算法。我们的运行时分析给出了更严格的界限计算$H_D$的所有已知算法的复杂性,我们表明,所有的方法具有可比的运行时间。
英文摘要:
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing $H_D$, and we show that all methods have comparable run times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。