Siirry suoraan sisältöön
Complexity of Computer Computations
Tallenna

Complexity of Computer Computations

(1) Determining lower bounds on the number of operations or steps required for computational solutions of specific problems such as matrix and polynomial calculations, sorting and other combinatorial problems, iterative com­ putations, solving equations, and computer resource allocation.
Alaotsikko
Proceedings of a symposium on the Complexity of Computer Computations, held March 20?22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department
Toimittaja
R. Miller
Painos
Softcover reprint of the original 1st ed. 1972
ISBN
9781468420036
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
14.4.2012
Sivumäärä
225