Is there a computable upper bound on the heights of rational solutions of a Diophantine equation with a finite number of solutions?

DOI10.15439/2017F42arXiv1511.06689MaRDI QIDQ6267606

Apoloniusz Tyszka

Publication date: 19 November 2015

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05)

This page was built for publication: Is there a computable upper bound on the heights of rational solutions of a Diophantine equation with a finite number of solutions?