Using sparse interpolation to solve multivariate Diophantine equations

DOI10.1145/2850449.2850459MaRDI QIDQ5270178zbMATH OpenOpenAlexFDO

Authors Baris Tuncer, Michael Monagan

Publication date 22 June 2017

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2850449.2850459

zbMATH Keywords

Hensel lifting algorithmmultivariate polynomial

Mathematics Subject Classification ID

Diophantine equations (11D99) Computer solution of Diophantine equations (11Y50)

Recommendations

• Using sparse interpolation in Hensel lifting
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• Factoring multivariate polynomials with many factors and huge coefficients
• On factorization of multivariate polynomials over algebraic number and function fields
• Extracting sparse factors from multivariate integral polynomials

Cites work

• An Improved Multivariate Polynomial Factoring Algorithm
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• Interpolating polynomials from their values

Cited in

(5)

• Factoring multivariate polynomials with many factors and huge coefficients
• Using sparse interpolation in Hensel lifting
• Some results on counting roots of polynomials and the Sylvester resultant
• Sparse Solutions of Linear Diophantine Equations
• Fast interpolation of multivariate polynomials with sparse exponents

This page was built for publication: Using sparse interpolation to solve multivariate Diophantine equations

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