Is there an algorithm that decides the solvability of a Diophantine equation with a finite number of solutions? (Q6283114): 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 09:13, 10 July 2024
scientific article; zbMATH DE number 900306937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is there an algorithm that decides the solvability of a Diophantine equation with a finite number of solutions? |
scientific article; zbMATH DE number 900306937 |
Statements
9 February 2017
0 references
math.NT
0 references
