A note on the paper ``Multiplication of polynomials modulo x^n by Murat Cenk and Ferruh Özbudak
From MaRDI portal
Publication:418751
DOI10.1016/J.TCS.2011.12.017zbMATH Open1238.68068OpenAlexW2055250291MaRDI QIDQ418751FDOQ418751
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
Recommendations
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Faster Multiplication in GF(2)[x]
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- Faster polynomial multiplication via multipoint Kronecker substitution
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Cites Work
- Title not available (Why is that?)
- 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)
- Multiplication of polynomials modulo \(x^n\)
- Optimal Karatsuba-like formulae for certain bilinear forms 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418751)