Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the number (heights) of integer solutions, if these solutions form a finite set? (Q6225681): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:34, 10 July 2024
scientific article; zbMATH DE number 900129271
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the number (heights) of integer solutions, if these solutions form a finite set? |
scientific article; zbMATH DE number 900129271 |
Statements
28 May 2011
0 references
math.LO
0 references
math.NT
0 references
