Some elementary proofs of lower bounds in complexity theory
- 1 January 1978
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 19 (1), 63-80
- https://doi.org/10.1016/0024-3795(78)90005-8
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- The complexity of vector-productsInformation Processing Letters, 1976
- On the complexity of quaternion multiplicationInformation Processing Letters, 1975
- Base tensorielle des matrices de Hankel (ou de Toeplitz) ApplicationsNumerische Mathematik, 1974
- Berechnung und Programm. IIActa Informatica, 1973
- Berechnung und programm. IActa Informatica, 1972
- On multiplication of 2 × 2 matricesLinear Algebra and its Applications, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- Ueber lineare Substitutionen und bilineare Formen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1878