On the optimal evaluation of a set of bilinear forms
Roger W. Brockett, David Dobkin · 1973
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 propose and defend a general model for studying bilinear multiplication in order to provide a common framework for discussing a wide class of problems.