Area-time tradeoffs for bilinear forms computations in VLSI

Articolo
Data di Pubblicazione:
1986
Abstract:
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.
Tipologia CRIS:
01.01 Articolo in rivista
Keywords:
bilinear form; area-time complexity; VLSI model; lower bound
Elenco autori:
Link alla scheda completa:
https://iris.cnr.it/handle/20.500.14243/377402
Pubblicato in:
INFORMATION PROCESSING LETTERS
Journal