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.

Area-time tradeoffs for bilinear forms computations in VLSI

Codenotti B;
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.
1986
Istituto di informatica e telematica - IIT
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
bilinear form
area-time complexity
VLSI model
lower bound
File in questo prodotto:
File Dimensione Formato  
prod_420079-doc_148723.pdf

solo utenti autorizzati

Descrizione: Area-time tradeoffs for bilinear forms computations in VLSI
Tipologia: Versione Editoriale (PDF)
Dimensione 362.74 kB
Formato Adobe PDF
362.74 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/377402
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact