PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Favati P. Area-time complexity of the unconstrained minimization problem. In: Calcolo, vol. 23 (2) pp. 175 - 184. Tipografia editrice Comm. Umberto Giardini, Pisa, 1986.
 
 
Abstract
(English)
In this paper we intestigate the complexity of unconstrained optimization in VLSI models. We present a design providing an upper bound to the areax(time)Δ2 complexity of unconstrained minimization, in the case of quadratic functions, which falls short of logarithmic factors to the known areax(time)Δ2 lower bound to matrix inversion.
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional