Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Favati P. Area-time complexity of the unconstrained minimization problem. Internal note IEI-B85-17, 1985.
The purpose of this paper is to investigate the complexity of unconstrained optimization, in VLSI models. The complexity results are stated in terms of the costumary AT^2 (area(time)^2) measure [6,7]. First, we note that the above problem is more general than matrix inversion or linear system solution. Then we present a design which provides an upper bound to the areax (time)^2 complexity of unconstrained minimization, in the case of quadratic functions, which is close to the known areax (time)^2 lower bounds to matrix inversion [5,6], up to logarithmic factors.
Subject Area-Time Complexity

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