A lower bound for polynomial multiplication

DOI10.1016/0304-3975(85)90174-4zbMath0607.94010OpenAlexW2020281898MaRDI QIDQ1086218

Michael Kaminski

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90174-4

zbMATH Keywords

number of multiplicationsthird degree polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06)

Related Items (1)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of multiplication in finite fields
• Fast multiplication of polynomials over fields of characteristic 2
• An Improved Lower Bound on Polynomial Multiplication
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• On the number of multiplications necessary to compute certain functions

This page was built for publication: A lower bound for polynomial multiplication