On the Complexity of Multivariate Polynomial Division

DOI10.1007/978-3-319-56932-1_28zbMath1383.68039OpenAlexW2738415072MaRDI QIDQ4610026

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

complexityalgorithmdivisionsparse reduction

Mathematics Subject Classification ID

Related Items (3)

Elimination ideal and bivariate resultant over finite fields ⋮ Fast amortized multi-point evaluation ⋮ Amortized multi-point evaluation of multivariate polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast on-line integer multiplication
• Relax, but don't be too lazy
• On the bit-complexity of sparse polynomial and series multiplication
• Multi-point evaluation in higher dimensions
• Generalized power series solutions to linear partial differential equations
• New algorithms for relaxed multiplication
• The truncated fourier transform and applications
• On the complexity of multivariate blockwise polynomial multiplication
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: On the Complexity of Multivariate Polynomial Division