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.
Area-time tradeoffs for bilinear forms computations in VLSI
Codenotti B;
1984
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_420544-doc_149102.pdf
accesso aperto
Descrizione: Area-time tradeoffs for bilinear forms computations in VLSI
Dimensione
1.03 MB
Formato
Adobe PDF
|
1.03 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
