Relaxed Hensel lifting of triangular sets
From MaRDI portal
Publication:480691
DOI10.1016/j.jsc.2014.09.012zbMath1386.68230OpenAlexW1993473229MaRDI QIDQ480691
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.012
power seriesonline algorithmpolynomial system solvingtriangular set\(p\)-adic integerrelaxed algorithmunivariate representation
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Other nonanalytic theory (11S85)
Related Items
Stable models of plane quartics with hyperelliptic reduction ⋮ A quasi-linear irreducibility test in \(\mathbb{K}x[y\)] ⋮ Capture-recapture and evolutionary ecology: Further comments ⋮ Directed evaluation ⋮ From implicit to recursive equations ⋮ Accelerated tower arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxed algorithms for \(p\)-adic numbers
- Homotopy techniques for multiplication modulo triangular sets
- On computing the determinant in small parallel time using a small number of processors
- Matrix multiplication via arithmetic progressions
- Newton's method and FFT trading
- Fast arithmetic for triangular sets: from theory to practice
- A new method for solving algebraic systems of positive dimension
- On fast multiplication of polynomials over arbitrary algebras
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Solving zero-dimensional systems through the rational univariate representation
- Lower bounds for diophantine approximations
- Computing parametric geometric resolutions
- On the complexity of computing determinants
- On the theories of triangular sets
- Fast on-line integer multiplication
- Relax, but don't be too lazy
- Complexity results for triangular sets
- From implicit to recursive equations
- New algorithms for relaxed multiplication
- Change of order for regular chains in positive dimension
- Fast multiplication of large numbers
- Modern Computer Algebra
- Faster relaxed multiplication
- Le rôle des structures de données dans les problèmes d'élimination
- Fast online multiplication of real numbers
- Relaxed p-adic Hensel lifting for algebraic systems
- Power series solutions of singular (q)-differential equations
- Lifting techniques for triangular decompositions
- Multiplying matrices faster than coppersmith-winograd
- Boolean Memories
- On the time-space complexity of geometric elimination procedures
- A Gröbner free alternative for polynomial system solving
