Is there an algorithm that decides the solvability of a Diophantine equation with a finite number of solutions?

From MaRDI portal
Revision as of 09:13, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6283114

arXiv1702.03861MaRDI QIDQ6283114

Apoloniusz Tyszka

Publication date: 9 February 2017




Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05)





This page was built for publication: Is there an algorithm that decides the solvability of a Diophantine equation with a finite number of solutions?

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6283114&oldid=35847717"
Powered by MediaWiki