The complexity of vector-products
From MaRDI portal
Publication:1243128
DOI10.1016/0020-0190(76)90084-3zbMath0369.68029MaRDI QIDQ1243128
Jan van Leeuwen, David P. Dobkin
Publication date: 1976
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(76)90084-3
Related Items
Some elementary proofs of lower bounds in complexity theory, Multiplicative complexity of direct sums of quadratic systems
Cites Work
- Optimum computation of p bilinear forms
- On the complexity of quaternion multiplication
- Some elementary proofs of lower bounds in complexity theory
- On multiplication of 2 \(\times\) 2 matrices
- Universality of iterated networks
- On the number of multiplications necessary to compute certain functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item