Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite? (Q6244802)
From MaRDI portal
scientific article; zbMATH DE number 900168515
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite? |
scientific article; zbMATH DE number 900168515 |
Statements
14 September 2013
0 references
math.NT
0 references
