Data di Pubblicazione:
1986
Abstract:
In this paper, the area-time complexity of a VLSI solver for tridiagonal linear systems is studied. Both a lower and an upper bound are derived which meet to within the exponent of the logarithmic factor.
Tipologia CRIS:
01.01 Articolo in rivista
Keywords:
VLSI models; area-time complexity; odd-even reduction; lower bound
Elenco autori:
Codenotti, Bruno
Link alla scheda completa:
Pubblicato in: