Atelier PARI/GP 2020
BELABAS, Karim
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
BELABAS, Karim
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
< Reduce
Institut de Mathématiques de Bordeaux [IMB]
Lithe and fast algorithmic number theory [LFANT]
Language
en
This item was published in
2020-01-22
English Abstract
Huge algebraic numbers are problematic because- computing with them algebraically is expensive;- approximations via floating point embeddings into C require huge accuracy (cancellation);- they are often intermediate results: ...Read more >
Huge algebraic numbers are problematic because- computing with them algebraically is expensive;- approximations via floating point embeddings into C require huge accuracy (cancellation);- they are often intermediate results: we do not want a result in K but in K∗/(K∗)2, or in- ZK/pk, or a floating point approximation to complex embeddings, or . . .- they may overflow the possibilities of the implementation: try 22100 .Read less <
Keywords
institut fourier
CNRS
UGA
Grenoble
Atelier PARI/GP 2020
English Keywords
S-units
compact representations
number fields
Origin
Hal imported