A lower bound for polynomial multiplication
type: Item
instance of: scholarly article
title: A lower bound for polynomial multiplication
zbMATH Open document ID: 0607.94010
DOI: 10.1016/0304-3975(85)90174-4
author: Michael Kaminski
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: We prove that multiplying two third degree polynomials over \({\mathbb{Z}}_ 2\) requires nine multiplications. This bound is tight.
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3983070
zbMATH Keywords: number of multiplications
zbMATH Keywords: third degree polynomials
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90174-4
OpenAlex ID: W2020281898
cites work: An Improved Lower Bound on Polynomial Multiplication
cites work: Q5588717
cites work: On the complexity of multiplication in finite fields
cites work: Q5665102
cites work: Fast multiplication of polynomials over fields of characteristic 2
cites work: Q4047029
cites work: On the number of multiplications necessary to compute certain functions
cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants
description: scientific article; zbMATH DE number 3983070