A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak

DOI10.1016/j.tcs.2011.12.017zbMath1238.68068OpenAlexW2055250291MaRDI QIDQ418751

Pan, Victor Y.

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.017

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Multiplication of polynomials modulo \(x^n\)
• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
• On short multiplications and divisions
• The middle product algorithm. I: Speeding up the division and square root of power series
• A long note on Mulders' short product
• Improved n-Term Karatsuba-Like Formulas in GF(2)

This page was built for publication: A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak