Compartir
Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas (en Inglés)
Miller, R. (Autor)
·
Springer
· Tapa Blanda
Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas (en Inglés) - Miller, R.
$ 103.93
$ 144.36
Ahorras: $ 40.42
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Viernes 19 de Julio y el
Viernes 26 de Julio.
Lo recibirás en cualquier lugar de Internacional entre 1 y 3 días hábiles luego del envío.
Reseña del libro "Complexity of Computer Computations: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas (en Inglés)"
The Symposium on the Complexity of Computer Compu- tations was held at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York, March 20-22, 1972. These Proceedings contain all papers presented at the Symposium together with a transcript of the concluding panel discussion and a comprehensive bibliography of the field. The Symposium dealt with complexity studies closely re- lated to how computations are actually performed on computers. Although this area of study has not yet found an appropriate or generally accepted name, the area is recognizable by the signif- icant commonality in problems, approaches, and motivations. The area can be described and delineated by examples such as the following. (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. (2) Developing improved algorithms for the solution of such problems which provide good upper bounds on the number of required operations, along with experimental and v vi PREFACE theoretical evidence concerning the efficiency and numer- ical accuracy of those algorithms. (3) Studying the effects on the efficiency of computation brought about by variations in sequencing and the intro- duction of parallelism.
