TY - CONF

T1 - ON THE OPTIMAL EVALUATION OF A SET OF BILINEAR FORMS.

AU - Brockett, Roger W.

AU - Dobkin, David

N1 - Funding Information:
*An earlier version of this paper appeared in the Proceedings of the 5th ACM Symposium on the Theory of Computing, May 1973. tSupported by the U.S. Office of Naval Research under the Joint Services Electronics Program by Contract NOOO14-67-A-0298-0006, Division of Engineering and Applied Physics, Harvard University, Cambridge, Mass. 02138. $Present address: Dept. of Computer Science, Yale University, New Haven, Conn. 06520. Work supported in part by NSF Grant GJ-43157.

PY - 1973

Y1 - 1973

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. This paper proposes and defends 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. This paper proposes and defends 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=0015770697&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015770697&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0015770697

SP - 88

EP - 95

T2 - ACM Symp on Theory of Comput, 5th Annu, Proc, Conf Rec, Pap

Y2 - 30 April 1973 through 2 May 1973

ER -