Algorithms for Modular Elliptic Curves¶
Cremona, J. E. (1997). Algorithms for Modular Elliptic Curves.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Tate's Algorithm
- Tate's algorithm turns a local elliptic-curve problem into an ordered decision procedure: choose a curve model and a place, make suitable coordinate changes, and test divisibility and residue-field roots until a reduction case is identified.
This sourceSecond edition, author-hosted Chapter III. Relevant locators: §3.1 printed pp. 62–63 / PDF zero-based indices 0–1, Weierstrass invariants and weighted coordinate changes; §3.2 printed pp. 65–68 / indices 3–6, local outputs, distinct minimization algorithm and Tate pseudocode. Full authored exposition and implementation account; not a direct inspection of Tate's 1975 original paper. The explicit pseudocode discussed here is over the integers and rational primes.
- Tate's algorithm turns a local elliptic-curve problem into an ordered decision procedure: choose a curve model and a place, make suitable coordinate changes, and test divisibility and residue-field roots until a reduction case is identified.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:16d97a8a6dc0 · see in the full table