arXiv · math/0409501
Complex Multiplication Tests for Elliptic Curves
Abstract
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.
Explore related subjects
Keep this discovery
Denis Charles. 2004-09-26. Complex Multiplication Tests for Elliptic Curves. https://arxiv.org/abs/math/0409501
Cite the original work for its findings. Save a collection to share your selection of sources.