Using Sparse Interpolation in Hensel Lifting

DOI10.1007/978-3-319-45641-6_25zbMath1453.13071OpenAlexW2512531676MaRDI QIDQ2830017

Baris Tuncer, Michael B. Monagan

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45641-6_25

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials, factorization in commutative rings (13P05)

Related Items

A New Black Box Factorization Algorithm - the Non-monic Case, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Detecting and parametrizing polynomial surfaces without base points, A fast parallel sparse polynomial GCD algorithm, A new algorithm for computing the extended Hensel construction of multivariate polynomials, The complexity of sparse Hensel lifting and sparse polynomial factorization

Uses Software

• Maple
• POLY

Cites Work

• Interpolating polynomials from their values
• Sparse multivariate Hensel lifting: a high-performance design and implementation
• POLY: A New Polynomial Data Structure for Maple 17
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Factoring Multivariate Polynomials Over the Integers
• An Improved Multivariate Polynomial Factoring Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item