Relaxed algorithms for p-adic numbers
From MaRDI portal
Publication:449711
DOI10.5802/JTNB.777zbMATH Open1247.11152OpenAlexW1987316492MaRDI QIDQ449711FDOQ449711
Authors: Jérémy Berthomieu, Joris van der Hoeven, Grégoire Lecerf
Publication date: 31 August 2012
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/219803
Recommendations
Cites Work
- A concise proof of the Kronecker polynomial system solver from scratch
- Title not available (Why is that?)
- Title not available (Why is that?)
- On fast multiplication of polynomials over arbitrary algebras
- Relax, but don't be too lazy
- Fast multiplication of large numbers
- Fast Algorithms for Manipulating Formal Power Series
- Title not available (Why is that?)
- Effective procedures in field theory
- Faster integer multiplication
- Fast evaluation of holonomic functions
- Efficient accelero-summation of holonomic functions
- New algorithms for relaxed multiplication
- \(p\)-adic analysis compared with real
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hensel and Newton Methods in Valuation Rings
- Title not available (Why is that?)
- Fast evaluation of holonomic functions near and in regular singularities
- Newton's method and FFT trading
Cited In (18)
- Extending the PSLQ Algorithm to Algebraic Integer Relations
- Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
- On an efficient algorithm for big rational number computations by parallel \(p\)-adics
- Faster relaxed multiplication
- On the complexity exponent of polynomial system solving
- Relax, but don't be too lazy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial root finding over local rings and application to error correcting codes
- Fast arithmetic in unramified \(p\)-adic fields
- Relaxed Hensel lifting of triangular sets
- A simple and fast online power series multiplication and its analysis
- Exact \(p\)-adic computation in Magma
- On FGLM algorithms with Tate algebras
- Relaxed \(p\)-adic Hensel lifting for algebraic systems
- Tracking \(p\)-adic precision
- \textsf{ZpL}: a \(p\)-adic precision package
Uses Software
This page was built for publication: Relaxed algorithms for \(p\)-adic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449711)