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.