The Linear Complexity of Computation
Jacques Morgenstern · Journal of the ACM · 1975
The notion of the linear algorithm to compute a family 7 of linear forms in r variables over a field is defined.Ways to save addltmns are investigated by analyzing the combinatorial aspects of linear dependences between subrows of a given matrix F. Further, an additive degree of freedom is defined, which turns out to be an exact measure of the complexity of computation of 7.