The area-time complexity of polynomial interpolation, and of the evaluation of a polynomial at given points is studied. We wil1 show VLSI designs producing bounds close to the lower bounds also derived.
Polynomial evaluation and interpolation in VLSI
Codenotti B;
1987
Abstract
The area-time complexity of polynomial interpolation, and of the evaluation of a polynomial at given points is studied. We wil1 show VLSI designs producing bounds close to the lower bounds also derived.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419587-doc_148351.pdf
accesso aperto
Descrizione: Polynomial evaluation and interpolation in VLSI
Dimensione
945.12 kB
Formato
Adobe PDF
|
945.12 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
