Visit our Christmas Gift Finder
Complexity of Computer Computations: 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 - The IBM Research Symposia Series (Paperback)
  • Complexity of Computer Computations: 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 - The IBM Research Symposia Series (Paperback)
zoom

Complexity of Computer Computations: 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 - The IBM Research Symposia Series (Paperback)

(editor)
£76.50
Paperback 225 Pages / Published: 14/04/2012
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781468420036
Number of pages: 225
Weight: 463 g
Dimensions: 254 x 178 x 12 mm
Edition: Softcover reprint of the original 1st ed. 197

You may also be interested in...

KS2 Science Study Book
Added to basket
Marie Curie
Added to basket
KS3 Science Study Guide - Higher
Added to basket
KS3 Science Workbook (with Answers)
Added to basket
KS3 Science All-in-One Revision and Practice
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.