How to do a p-descent on an elliptic curve
By Edward F. Schaefer, Michael Stoll. 2003
110 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/f2cc2b3b05e803d75896c1df884d03b44ded0c1b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Geometry and Topology
- John Cremona
- Michael Stoll
- Sebastian Karl Michael Stamminger
- Tom A. Fisher
- Manjul Bhargava
- Samir Siksek
- A. Shankar
- Bjorn Poonen
In Mathematical Physics
- John Cremona
- Tom A. Fisher
- Sebastian Karl Michael Stamminger
- Michael Stoll
- Bjorn Poonen
- S. Tronto
- Davide Lombardo
Citations in the corpus
- Explicit n-descent on elliptic curves, I. Algebra (2006, methodology): “The starting point for our work is the paper of Schaefer and Stoll [14], which improves on earlier methods in [5].”
- Explicit 8-descent on elliptic curves (2005, background): “For n = p an odd prime there is a theoretical description which is feasible in practice only for n = 3 [19].”
- MINIMISATION AND REDUCTION OF 2-, 3- AND 4-COVERINGS OF ELLIPTIC CURVES (2009, methodology): “) The final form of these ternary cubics was obtained by applying the methods described in this paper to the original models produced by the algorithms described in [Schaefer and Stoll 2004] and [Cremona et al.”