Some elementary proofs of lower bounds in complexity theory
type: Item
instance of: scholarly article
title: Some elementary proofs of lower bounds in complexity theory
zbMATH Open document ID: 0374.15008
DOI: 10.1016/0024-3795(78)90005-8
author: J. Van Leeuwen
author: Peter van Emde Boas
published in: Linear Algebra and its Applications
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 15A63
Mathematics Subject Classification ID: 15A30
zbMATH DE Number: 3582309
MaRDI profile type: Publication
full work available at URL: 0024-3795(78)90005-8
OpenAlex ID: W2155851636
cites work: Q4773298
cites work: Q4094392
cites work: On the Number of Multiplications Required for Matrix Multiplication
cites work: On the complexity of quaternion multiplication
cites work: The complexity of vector-products
cites work: Q5674406
cites work: Universality of iterated networks
cites work: Algebras Having Linear Multiplicative Complexities
cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
cites work: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
cites work: Q5735181
cites work: Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
cites work: Q4139684
cites work: Q5829318
cites work: Berechnung und Programm. I
cites work: Berechnung und Programm. II
cites work: Q4047029
cites work: On the number of multiplications necessary to compute certain functions
cites work: On multiplication of 2 \(\times\) 2 matrices
description: scientific article; zbMATH DE number 3582309