Complexity of Computer Computations [E-Book] : 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 / edited by Raymond E. Miller, James W. Thatcher, Jean D. Bohlinger.
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 compre...
Saved in:
Full text |
|
Personal Name(s): | Bohlinger, Jean D., editor |
Miller, Raymond E., editor / Thatcher, James W., editor | |
Imprint: |
Boston, MA :
Springer,
1972
|
Physical Description: |
X, 225 p. online resource. |
Note: |
englisch |
ISBN: |
9781468420012 |
DOI: |
10.1007/978-1-4684-2001-2 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
The IBM Research Symposia Series
|
Subject (LOC): |
- Evaluation of Rational Functions
- Solving Linear Equations by Means of Scalar Products
- Simple Proofs of Lower Bounds for Polynomial Evaluation
- On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
- Efficient Iterations for Algebraic Numbers
- Parallel Iteration Methods
- The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations
- The Computational Complexity of Elliptic Partial Differential Equations
- Reducibility Among Combinatorial Problems
- Permuting Information in Idealized Two-Level Storage
- An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File
- Toward a Lower Bound for Sorting Networks
- Isomorphism of Planar Graphs
- Efficiency of Equivalence Algorithms
- Panel Discussion
- Name Index.