Maximal bilinear complexity and codes
type: Item
instance of: scholarly article
title: Maximal bilinear complexity and codes
zbMATH Open document ID: 0717.68041
DOI: 10.1016/0024-3795(91)90060-A
author: Joachim von zur Gathen
published in: Linear Algebra and its Applications
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 4182819
zbMATH Keywords: bilinear complexity
zbMATH Keywords: algebraic complexity theory
zbMATH Keywords: lower bounds
zbMATH Keywords: maximal ranks of tensors
MaRDI profile type: Publication
cites work: On the maximal multiplicative complexity of a family of bilinear forms
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: On the optimal evaluation of a set of bilinear forms
cites work: An Improved Lower Bound on Polynomial Multiplication
cites work: Lectures on the complexity of bilinear problems
cites work: Q3756516
cites work: Global properties of tensor rank
cites work: Optimal Evaluation of Pairs of Bilinear Forms
cites work: Computations of Bilinear Forms over Finite Fields
cites work: A new approach to error-correcting codes
cites work: Typical tensorial rank
cites work: Q4004139
cites work: On two extremal matrix problems
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Q4047029
cites work: Rank and optimal computation of generic tensors
cites work: Q3690212
full work available at URL: 0024-3795(91)90060-a
OpenAlex ID: W2015746530
description: scientific article