On the optimal evaluation of a set of bilinear forms

Roger W. Brockett; David Paul Dobkin

doi:10.1145/800125.804039

On the optimal evaluation of a set of bilinear forms

Roger W. Brockett, David Paul Dobkin

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	88-95
Number of pages	8
Journal	Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/800125.804039
State	Published - Apr 30 1973
Externally published	Yes
Event	5th Annual ACM Symposium on Theory of Computing, STOC 1973 - Austin, United States Duration: Apr 30 1973 → May 2 1973

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1145/800125.804039

Cite this

@article{7607f478eb9f45cba096f27c82eaa440,

title = "On the optimal evaluation of a set of bilinear forms",

abstract = "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.",

author = "Brockett, {Roger W.} and Dobkin, {David Paul}",

year = "1973",

month = apr,

day = "30",

doi = "10.1145/800125.804039",

language = "English (US)",

pages = "88--95",

journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0737-8017",

publisher = "Association for Computing Machinery (ACM)",

note = "5th Annual ACM Symposium on Theory of Computing, STOC 1973 ; Conference date: 30-04-1973 Through 02-05-1973",

}

TY - JOUR

T1 - On the optimal evaluation of a set of bilinear forms

AU - Brockett, Roger W.

AU - Dobkin, David Paul

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 -

On the optimal evaluation of a set of bilinear forms

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this