On the complexity of multivariate polynomial division

DOI10.1007/978-3-319-56932-1_28MaRDI QIDQ4610026zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven

Publication date 5 April 2018

Published in Applications of Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-56932-1_28

zbMATH Keywords

algorithmcomplexitydivisionsparse reduction

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials, factorization in commutative rings (13P05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Improved dense multivariate polynomial factorization algorithms
• scientific article; zbMATH DE number 2125607
• Factoring sparse multivariate polynomials
• Irreducibility of multivariate polynomials
• scientific article; zbMATH DE number 3399383

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fast on-line integer multiplication
• Generalized power series solutions to linear partial differential equations
• scientific article; zbMATH DE number 3935185 (Why is no real title available?)
• scientific article; zbMATH DE number 1253958 (Why is no real title available?)
• scientific article; zbMATH DE number 2151193 (Why is no real title available?)
• Multi-point evaluation in higher dimensions
• New algorithms for relaxed multiplication
• On the bit-complexity of sparse polynomial and series multiplication
• On the complexity of multivariate blockwise polynomial multiplication
• Relax, but don't be too lazy
• The truncated fourier transform and applications

Cited in

(12)

• Polynomial expressions for non-binomial structures
• Amortized multi-point evaluation of multivariate polynomials
• Fast amortized multi-point evaluation
• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• scientific article; zbMATH DE number 1512154 (Why is no real title available?)
• On the Complexity of Hybrid n -Term Karatsuba Multiplier for Trinomials
• On the complexity of computing the greatest common divisor of several univariate polynomials
• scientific article; zbMATH DE number 3399383 (Why is no real title available?)
• Elimination ideal and bivariate resultant over finite fields
• Bivariate polynomial reduction and elimination ideal over finite fields
• Amortized bivariate multi-point evaluation
• \textsf{Boomy}: batch opening of multivariate polynomial commitment

This page was built for publication: On the complexity of multivariate polynomial division

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