J. Berthomieu, J. Hoeven, and G. Lecerf, Relaxed algorithms for p-adic numbers, Journal de Th??orie des Nombres de Bordeaux, vol.23, issue.3, pp.541-577, 2011.
DOI : 10.5802/jtnb.777
URL : https://hal.archives-ouvertes.fr/hal-00486680

D. Bini and V. Y. Pan, Polynomial and matrix computations, 1994.
DOI : 10.1007/978-1-4612-0265-3

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, 1997.
DOI : 10.1007/978-3-662-03338-8

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

Z. Chen and A. Storjohann, Version 1.0.3. Available from http, IML, the Integer Matrix Library, 2004.

J. D. Dixon, Exact solution of linear equations usingP-adic expansions, Numerische Mathematik, vol.82, issue.1, pp.137-141, 1982.
DOI : 10.1007/BF01459082

M. J. Fischer and L. J. Stockmeyer, Fast on-line integer multiplication, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.317-331, 1974.
DOI : 10.1145/800125.804037

M. Fürer, Faster Integer Multiplication, Proceedings of STOC 2007, pp.57-66, 2007.

J. V. Gathen and J. Gerhard, Modern computer algebra, 2003.

P. Giorgi, Arithmétique et algorithmique en algèbre linéaire exacte pour la bibliothèque LinBox Available from http, 2004.

T. Granlund, GMP, the GNU multiple precision arithmetic library, 1991. Version 5.0.2. Available from http

M. V. Hoeij, Factorization of Differential Operators with Rational Functions Coefficients, Journal of Symbolic Computation, vol.24, issue.5, pp.537-561, 1997.
DOI : 10.1006/jsco.1997.0151

J. V. Hoeven, Lazy multiplication of formal power series, Proceedings of ISSAC '97, pp.17-20, 1997.

J. V. Hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

J. V. Hoeven, New algorithms for relaxed multiplication, Journal of Symbolic Computation, vol.42, issue.8, pp.792-802, 2007.
DOI : 10.1016/j.jsc.2007.04.004

J. V. Hoeven and H. , Relaxed resolution of implicit equations, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00441977

J. V. Hoeven, From implicit to recursive equations, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00583125

J. V. Hoeven, SVN Version 6374 Available from http, 2002.

G. Kapoulas, Polynomially Time Computable Functions over p-Adic Fields, Computability and complexity in analysis, pp.101-118, 2001.
DOI : 10.1007/3-540-45335-0_8

J. Karczmarczuk, Generating power of lazy semantics, Theoretical Computer Science, vol.187, issue.1-2, pp.203-219, 1997.
DOI : 10.1016/S0304-3975(97)00065-0

R. T. Moenck and J. H. Carter, Approximate algorithms to derive exact solutions to systems of linear equations, EUROSAM '79, pp.65-73, 1979.
DOI : 10.1007/3-540-09519-5_60

I. Newton, La méthode des fluxions, et les suites infinies. de Bure a??néa??né, 1740. French traduction by G. Buffon of the 1671 paper

M. Schröder, Fast online multiplication of real numbers, STACS 97, pp.81-92, 1997.
DOI : 10.1007/BFb0023450

A. Storjohann, High-order lifting and integrality certification, Journal of Symbolic Computation, vol.36, issue.3-4, pp.613-648, 2002.
DOI : 10.1016/S0747-7171(03)00097-X
URL : http://doi.org/10.1016/s0747-7171(03)00097-x