Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Relaxed algorithms for p -adic numbers

Jérémy Berthomieu;  Joris van der Hoeven;  Grégoire Lecerf — 2011

Journal de Théorie des Nombres de Bordeaux

Current implementations of p -adic numbers usually rely on so called zealous algorithms, which compute with truncated p -adic expansions at a precision that can be specified by the user. In combination with Newton-Hensel type lifting techniques, zealous algorithms can be made very efficient from an asymptotic point of view. In the similar context of formal power series, another so called lazy technique is also frequently implemented....

Page 1

Download Results (CSV)