This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Straßen, V. (1981). The computational complexity of bilinear multiplications. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017294
Download citation
DOI: https://doi.org/10.1007/BFb0017294
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive