PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Lotti G. Area-time tradeoffs for bilinear forms computations in VLSI. In: Information Processing Letters, vol. 23 pp. 107 - 109. North Holland, 1986.
 
 
Abstract
(English)
The area-time tradeoff has been provided separately for several computational problems. The first attempt to obtain lower bounds to ATΔ2 for different problems by using the same technique was made by Vuillemin who considered the computation of some transitive functions.
Subject Bilinear form
Area-time complexity
VLSI model
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