PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Lotti G. Area-time tradeoffs for bilinear forms computations in VLSI. Internal note IEI-B84-23, 1984.
 
 
Abstract
(English)
An important class of problem in the complexity field is that concerning the computation of bilinear forms. In this work a criterion is given which allows obtainig lower bounds to AT^2 for the bilinear forms computational problem.
Subject VLSI model
Area-Time Complexity
Bilinear forms
Lower Bound


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional