Relaxed Hensel lifting of triangular sets
type: Item
instance of: scholarly article
title: Relaxed Hensel lifting of triangular sets
zbMATH Open document ID: 1386.68230
author: Romain Lebreton
published in: Journal of Symbolic Computation
publication date: 2014-12-09T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 11S85
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 13P05
zbMATH DE Number: 6378449
zbMATH Keywords: polynomial system solving
zbMATH Keywords: online algorithm
zbMATH Keywords: relaxed algorithm
zbMATH Keywords: triangular set
zbMATH Keywords: univariate representation
zbMATH Keywords: \(p\)-adic integer
zbMATH Keywords: power series
describes a project that uses: ISOLATE
describes a project that uses: Mathemagix
describes a project that uses: gmp
describes a project that uses: Kronecker
MaRDI profile type: Publication
full work available at URL: j.jsc.2014.09.012
OpenAlex ID: W1993473229
cites work: On the theories of triangular sets
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Relaxed p-adic Hensel lifting for algebraic systems
cites work: Relaxed algorithms for \(p\)-adic numbers
cites work: Homotopy techniques for multiplication modulo triangular sets
cites work: Power series solutions of singular (q)-differential equations
cites work: Q4331740
cites work: On fast multiplication of polynomials over arbitrary algebras
cites work: Matrix multiplication via arithmetic progressions
cites work: Lifting techniques for triangular decompositions
cites work: Q3568138
cites work: Change of order for regular chains in positive dimension
cites work: Q5302073
cites work: Fast on-line integer multiplication
cites work: Q3549597
cites work: Q3033872
cites work: Q3973337
cites work: Lower bounds for diophantine approximations
cites work: Le rôle des structures de données dans les problèmes d'élimination
cites work: A Gröbner free alternative for polynomial system solving
cites work: On the time-space complexity of geometric elimination procedures
cites work: Boolean Memories
cites work: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
cites work: Q4234262
cites work: On the complexity of computing determinants
cites work: Q3973340
cites work: A new method for solving algebraic systems of positive dimension
cites work: Fast arithmetic for triangular sets: from theory to practice
cites work: Q5514221
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: Fast multiplication of large numbers
cites work: Q4660711
cites work: Complexity results for triangular sets
cites work: Computing parametric geometric resolutions
cites work: Fast online multiplication of real numbers
cites work: Q4226932
cites work: Relax, but don't be too lazy
cites work: New algorithms for relaxed multiplication
cites work: Newton's method and FFT trading
cites work: From implicit to recursive equations
cites work: Faster relaxed multiplication
cites work: Multiplying matrices faster than coppersmith-winograd
cites work: Modern computer algebra
DOI: 10.1016/J.JSC.2014.09.012
Recommended article: Relaxations of mixed integer sets from lattice-free polyhedra
Recommended article: SPECTRAHEDRAL LIFTS OF CONVEX SETS
Recommended article: $H^2$-Stable Polynomial Liftings on Triangles
Recommended article: Q4935868
Recommended article: Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes
Recommended article: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Recommended article: Whitney triangulations of semialgebraic sets
Recommended article: On the theories of triangular sets