The multiplicative complexity of certain semilinear systems defined by polynomials
type: Item
instance of: scholarly article
title: The multiplicative complexity of certain semilinear systems defined by polynomials
zbMATH Open document ID: 0528.65006
DOI: 10.1016/0196-8858(80)90013-5
author: Louis Auslander
author: Shmuel Winograd
published in: Advances in Applied Mathematics
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65T40
zbMATH DE Number: 3839215
zbMATH Keywords: semilinear systems defined by polynomials
zbMATH Keywords: minimal algorithm
zbMATH Keywords: multiplicative complexity
zbMATH Keywords: simple arithmetic operations
zbMATH Keywords: steps of arithmetic operations
MaRDI profile type: Publication
full work available at URL: 0196-8858(80)90013-5
OpenAlex ID: W1968078911
cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants
cites work: On the multiplicative complexity of the discrete Fourier transform
cites work: Q4401564
cites work: Q5601777
description: scientific article; zbMATH DE number 3839215