The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities

Until very recently, the lower bounds on the additive complexity of intensively studied linear and bilinear arithmetic algorithms for arithmetic computational problems have relied on the active operation-basic substitution argument. Consequently, these bounds have not exceeded the dimension of the p...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1981-11, Vol.13 (2), p.71-72
1. Verfasser:	Pan, V.Ya
Format:	Artikel
Sprache:	eng
Schlagworte:	Additive complexity Algorithms bilinear algorithms Computer programming Computer science Matrix tensor rank
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!