A fast algorithm for finding small solutions of \(F(x,y)=G(x,y)\) over number fields (Q2567425)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 2211912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for finding small solutions of \(F(x,y)=G(x,y)\) over number fields |
scientific article; zbMATH DE number 2211912 |
Statements
A fast algorithm for finding small solutions of \(F(x,y)=G(x,y)\) over number fields (English)
0 references
4 October 2005
0 references
Thue equations
0 references
binary form equations
0 references
computing small solutions
0 references
reductions
0 references
enumeration
0 references
0.8666514158248901
0 references
0.8656941652297974
0 references
0.8006317615509033
0 references
0.7928730249404907
0 references
0.789579451084137
0 references
