Multiplication of polynomials modulo \(x^n\)
type: Item
instance of: scholarly article
title: Multiplication of polynomials modulo \(x^n\)
zbMATH Open document ID: 1216.68123
author: Murat Cenk
author: Ferruh Özbudak
published in: Theoretical Computer Science
publication date: 2011-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5920424
zbMATH Keywords: multiplication of polynomials
zbMATH Keywords: multiplicative complexity
zbMATH Keywords: multiplication algorithms
zbMATH Keywords: multiplication of power series
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.02.031
OpenAlex ID: W2037384341
cites work: Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\)
cites work: Q5301645
cites work: Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
cites work: On multiplication in finite fields
cites work: Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
cites work: Algebraic complexities and algebraic curves over finite fields
cites work: Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
cites work: Q4044675
cites work: Multiplicative complexity of polynomial multiplication over finite fields
cites work: Five, six, and seven-term Karatsuba-like formulae
cites work: Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
cites work: Q4027646
cites work: Q3883493
DOI: 10.1016/J.TCS.2011.02.031
description: scientific article; zbMATH DE number 5920424