Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
DOI10.1007/978-1-4939-6969-2_13zbMath1410.11045OpenAlexW2753002193MaRDI QIDQ4604874
Michael A. Bennett, Andrew Rechnitzer
Publication date: 6 March 2018
Published in: Recent Progress and Modern Challenges in Applied Mathematics, Modeling and Computational Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4939-6969-2_13
Forms of degree higher than two (11E76) Elliptic curves over global fields (11G05) Thue-Mahler equations (11D59) Computer solution of Diophantine equations (11Y50) Elliptic curves (14H52) Cubic and quartic Diophantine equations (11D25) Continued fraction calculations (number-theoretic aspects) (11Y65)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the resolution of Thue inequalities
- On Néron's classification of elliptic curves of residue characteristics 2 and 3
- The weighted sum of two S-units being a square
- On the practical solution of the Thue equation
- Probabilistic algorithm for testing primality
- Classical diophantine equations
- The number of elliptic curves over \(\mathbb{Q}\) with conductor \(N\)
- The Magma algebra system. I: The user language
- On the modularity of elliptic curves over 𝐐: Wild 3-adic exercises
- Strong pseudoprimes to twelve prime bases
- Courbes de Weil semi-stables de discriminant une puissance m-ième.
- Mordell’s equation: a classical approach
- On the conductor of an elliptic curve with a rational point of order 2
- Elliptic Curves of Conductor 11
- Solving a Specific Thue-Mahler Equation
- Elliptic Curves of Prime Conductor
- Reduction of Binary Cubic and Quartic Forms
- A fast algorithm to compute cubic fields
- Elliptische Kurven mit vorgeschriebenem Reduktionsverhalten. II
- Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
- Elliptic Curves Over the Rationals with Bad Reduction at Only one Prime
- The behavior of the Mordell-Weil group of elliptic curves
- Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
- Algorithmic Number Theory
- On the density of discriminants of cubic fields. II
- An effective p-adic analogue of a theorem of Thue III. The diophantine equation $y^2 = x^2 + k$
- The Reduction of a Binary Cubic Form (I)
This page was built for publication: Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime