Complexity of computer computations (proc.) [Softcover reprint of the original 1st ed. 1972] 1468420038, 9781468420036, 978-1-4684-2001-2

The Symposium on the Complexity of Computer Compu­ tations was held at the IBM Thomas J. Watson Research Center in Yorkt

431 60 2MB

English Pages 225 [228] Year 1972

Report DMCA / Copyright

DOWNLOAD FILE

Complexity of computer computations (proc.) [Softcover reprint of the original 1st ed. 1972]
 1468420038, 9781468420036, 978-1-4684-2001-2

Table of contents :
Front Matter....Pages i-x
Evaluation of Rational Functions....Pages 1-10
Solving Linear Equations by Means of Scalar Products....Pages 11-20
Simple Proofs of Lower Bounds for Polynomial Evaluation....Pages 21-30
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication....Pages 31-40
Efficient Iterations for Algebraic Numbers....Pages 41-52
Parallel Iteration Methods....Pages 53-60
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations....Pages 61-71
The Computational Complexity of Elliptic Partial Differential Equations....Pages 73-83
Reducibility among Combinatorial Problems....Pages 85-103
Permuting Information in Idealized Two-Level Storage....Pages 105-109
An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File....Pages 111-118
Toward a Lower Bound for Sorting Networks....Pages 119-129
Isomorphism of Planar Graphs (Working Paper)....Pages 131-152
Efficiency of Equivalence Algorithms....Pages 153-167
Panel Discussion....Pages 169-185
Back Matter....Pages 187-225

Polecaj historie