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

  • Raymond E. Miller
  • James W. Thatcher
  • Jean D. Bohlinger

Part of the The IBM Research Symposia Series book series (IRSS)

Table of contents

  1. Front Matter
    Pages i-x
  2. Volker Strassen
    Pages 1-10
  3. Edward M. Reingold, A. Ian Stocks
    Pages 21-30
  4. Michael S. Paterson
    Pages 41-52
  5. Shmuel Winograd
    Pages 53-60
  6. Richard M. Karp
    Pages 85-103
  7. David C. Van Voorhis
    Pages 119-129
  8. J. E. Hopcroft, R. E. Tarjan
    Pages 131-152
  9. Michael J. Fischer
    Pages 153-167
  10. Raymond E. Miller, James W. Thatcher, Jean D. Bohlinger
    Pages 169-185
  11. Back Matter
    Pages 187-225

About this book


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.


ACE Area Calc Matrix Watson algorithms complexity computation computer efficiency equation field form parallelism vi

Editors and affiliations

  • Raymond E. Miller
  • James W. Thatcher
  • Jean D. Bohlinger
    • 1
  1. 1.Mathematical Sciences DepartmentIBM Thomas J. Watson Research CenterYorktown HeightsUSA

Bibliographic information