 |
|
|
Item Details
| Title:
|
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 |
| By: |
R. Miller (Editor) |
| Format: |
Paperback |
| List price:
|
£69.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
1468420038 |
| ISBN 13: |
9781468420036 |
| Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
| Pub. date: |
1 August, 1972 |
| Edition: |
Softcover reprint of the original 1st ed. 1972 |
| Series: |
The IBM Research Symposia Series |
| Pages: |
225 |
| Synopsis: |
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. |
| Illustrations: |
X, 225 p. |
| Publication: |
US |
| Imprint: |
Springer-Verlag New York Inc. |
| Returns: |
Non-returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|