Relaxed p-adic Hensel lifting for algebraic systems
DOI10.1145/2442829.2442842zbMATH Open1308.68158OpenAlexW1987033004MaRDI QIDQ5244517FDOQ5244517
Romain Lebreton, Jérémy Berthomieu
Publication date: 27 March 2015
Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2442829.2442842
complexitypower seriesinteger linear systemsrelaxed algorithmsalgebraic system resolutionlazy \(p\)-adic numbers
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Other nonanalytic theory (11S85)
Cited In (8)
- Stable models of plane quartics with hyperelliptic reduction
- Super-linear convergence in the p -adic QR-algorithm
- 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
- Solving p-adic polynomial systems via iterative eigenvector algorithms
- From implicit to recursive equations
Uses Software
This page was built for publication: Relaxed p-adic Hensel lifting for algebraic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244517)
