ON THE OPTIMAL EVALUATION OF A SET OF BILINEAR FORMS.

Roger W. Brockett; David Dobkin

ON THE OPTIMAL EVALUATION OF A SET OF BILINEAR FORMS.

Roger W. Brockett, David Dobkin

Research output: Contribution to conference › Paper › peer-review

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. 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.

Original language	English (US)
Pages	88-95
Number of pages	8
State	Published - Jan 1 1973
Event	ACM Symp on Theory of Comput, 5th Annu, Proc, Conf Rec, Pap - Austin, Tex Duration: Apr 30 1973 → May 2 1973

Other

Other	ACM Symp on Theory of Comput, 5th Annu, Proc, Conf Rec, Pap
City	Austin, Tex
Period	4/30/73 → 5/2/73

All Science Journal Classification (ASJC) codes

Engineering(all)

Access to Document

Cite this

@conference{d42da098e8624f32ae40a96f1244bb13,

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

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

year = "1973",

month = jan,

day = "1",

language = "English (US)",

pages = "88--95",

note = "ACM Symp on Theory of Comput, 5th Annu, Proc, Conf Rec, Pap ; Conference date: 30-04-1973 Through 02-05-1973",

}

TY - CONF

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

AU - Brockett, Roger W.

AU - Dobkin, David

PY - 1973/1/1

Y1 - 1973/1/1

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 -