arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0409501math.NT

Complex Multiplication Tests for Elliptic Curves

Denis Charles

英文摘要:

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized algorithm can be adapted to yield the discriminant of the endomorphism ring of the curve.

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

↑