Sparse multiplication for skew polynomials

DOI10.1145/3373207.3404023MaRDI QIDQ5145973zbMATH OpenOpenAlexWikidataFDO

Authors Éric Schost, Mark Giesbrecht, Qiao-Long Huang

Publication date 22 January 2021

Published in Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

multiplicationskew polynomialssparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast Multiplication for Skew Polynomials
• Nearly Optimal Sparse Polynomial Multiplication
• Computing sparse multiples of polynomials
• Computing sparse multiples of polynomials
• Essentially optimal sparse polynomial multiplication
• Sparse generalised polynomials
• Algorithms for computing sparse shifts for multivariate polynomials
• scientific article; zbMATH DE number 1254239
• On some computations on sparse polynomials
• Sparse squares of polynomials

Cited in

(6)

• Fast Multiplication for Skew Polynomials
• Nearly Optimal Sparse Polynomial Multiplication
• Skew-polynomial-sparse matrix multiplication
• Sparse multiplication of multivariate linear differential operators
• An algorithm for computing greatest common right divisors of parametric Ore polynomials
• A quasi-optimal lower bound for skew polynomial multiplication

This page was built for publication: Sparse multiplication for skew polynomials

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