The complexity of vector-products
type: Item
instance of: scholarly article
title: The complexity of vector-products
zbMATH Open document ID: 0369.68029
DOI: 10.1016/0020-0190(76)90084-3
author: J. Van Leeuwen
author: David P. Dobkin
published in: Information Processing Letters
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3576695
MaRDI profile type: Publication
full work available at URL: 0020-0190(76)90084-3
OpenAlex ID: W1990335024
cites work: Q4773298
cites work: Q4190138
cites work: Q4094392
cites work: On the complexity of quaternion multiplication
cites work: Universality of iterated networks
cites work: Q5735181
cites work: Optimum computation of p bilinear forms
cites work: Q4047029
cites work: Some elementary proofs of lower bounds in complexity theory
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 3576695