TY - JOUR
T1 - On the optimal evaluation of a set of bilinear forms
AU - Brockett, Roger W.
AU - Dobkin, David
N1 - Publisher Copyright:
© 1973 Association for Computing Machinery. All rights reserved.
PY - 1973/4/30
Y1 - 1973/4/30
N2 - Although general theories are beginning to emerge in the area of automata based complexity theory, there are very few general methods or even general problem formulations in the area of arithmetic complexity. In this paper we pronose and defend a general model for studying bilinear multiplication in order to provide a common framework for discussing a wide class of problems.
AB - Although general theories are beginning to emerge in the area of automata based complexity theory, there are very few general methods or even general problem formulations in the area of arithmetic complexity. In this paper we pronose and defend a general model for studying bilinear multiplication in order to provide a common framework for discussing a wide class of problems.
UR - http://www.scopus.com/inward/record.url?scp=85059736626&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059736626&partnerID=8YFLogxK
U2 - 10.1145/800125.804039
DO - 10.1145/800125.804039
M3 - Conference article
AN - SCOPUS:85059736626
SP - 88
EP - 95
JO - Proceedings of the Annual ACM Symposium on Theory of Computing
JF - Proceedings of the Annual ACM Symposium on Theory of Computing
SN - 0737-8017
T2 - 5th Annual ACM Symposium on Theory of Computing, STOC 1973
Y2 - 30 April 1973 through 2 May 1973
ER -