Algorithms for Finding Good Examples for the abc and Szpiro Conjectures
From MaRDI portal
Publication:4296151
DOI10.1080/10586458.1993.10504279zbMath0818.11050OpenAlexW2076988657WikidataQ123258953 ScholiaQ123258953MaRDI QIDQ4296151
Publication date: 24 August 1995
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231906
Number-theoretic algorithms; complexity (11Y16) Higher degree equations; Fermat's equation (11D41) Diophantine equations (11D99)
Related Items (3)
LLL \(\and\) ABC ⋮ Good elliptic curves with a specified torsion subgroup ⋮ Gaps between integers with the same prime factors
Cites Work
This page was built for publication: Algorithms for Finding Good Examples for the abc and Szpiro Conjectures