The complexity of vector-products

DOI10.1016/0020-0190(76)90084-3zbMath0369.68029OpenAlexW1990335024MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

Multiplicative complexity of direct sums of quadratic systems ⋮ Some elementary proofs of lower bounds in complexity theory

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