Area-time tradeoffs for bilinear forms computations in VLSI

Academic Article
Publication Date:
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.
Iris type:
01.01 Articolo in rivista
Keywords:
bilinear form; area-time complexity; VLSI model; lower bound
List of contributors:
Handle:
https://iris.cnr.it/handle/20.500.14243/377402
Published in:
INFORMATION PROCESSING LETTERS
Journal