Computing sparse GCD of multivariate polynomials via polynomial interpolation

DOI10.1007/S11424-017-6332-0MaRDI QIDQ1621170zbMATH OpenOpenAlexFDO

Authors Min Tang, Bingyu Li, Zhenbing Zeng

Publication date 8 November 2018

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-017-6332-0

zbMATH Keywords

multivariate polynomial interpolationBen-Or/Tiwari algorithmsparse GCDZippel's algorithm

Mathematics Subject Classification ID

Numerical interpolation (65D05)

Recommendations

• Computing sparse multiples of polynomials
• Computing sparse multiples of polynomials
• Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
• A new algorithm for sparse interpolation of multivariate polynomials
• Computing approximate GCD of multivariate polynomials
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• scientific article; zbMATH DE number 871950
• A fast parallel sparse polynomial GCD algorithm
• A fast parallel sparse polynomial GCD algorithm

Cites work

• scientific article; zbMATH DE number 3936514 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 6797621 (Why is no real title available?)
• A sparse modular GCD algorithm for polynomials over algebraic function fields
• Algorithms for polynomial GCD computation over algebraic function fields
• Algorithms for the non-monic case of the sparse modular GCD algorithm
• Factoring Multivariate Polynomials Over the Integers
• Multivariate Polynomial Factorization
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• On Hensel factorization. I
• Robust estimation of GCD with sparse coefficients
• Sparse interpolation of multivariate rational functions
• Subresultants and Reduced Polynomial Remainder Sequences
• The EEZ-GCD algorithm
• Vector rational number reconstruction

Cited in

(3)

• Irreducibility and greatest common divisor algorithms for sparse polynomials
• An improved EZ-GCD algorithm for multivariate polynomials
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials

Describes a project that uses

Uses Software

• GCDHEU

This page was built for publication: Computing sparse GCD of multivariate polynomials via polynomial interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621170)