Relating decision and search algorithms for rational points on curves of higher genus (Q1407610)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relating decision and search algorithms for rational points on curves of higher genus |
scientific article |
Statements
Relating decision and search algorithms for rational points on curves of higher genus (English)
0 references
16 September 2003
0 references
Let \(C\) be a plane irreducible curve over the field of rational numbers of geometric genus \(\geq 2\). The author proves that the existence of an algorithm that decides whether or not \(C({\mathbb Q}) = \emptyset\) implies the existence of a deterministic algorithm that finds the full solution set \(C({\mathbb Q})\).
0 references
rational point
0 references
plane curve
0 references
diophantine equation
0 references
algorithm
0 references
