Login / Signup
Complexity of Computer Computations
1972
1972
1972
Keyphrases
Publications
1972
Volker Strassen
Evaluation of Rational Functions.
Complexity of Computer Computations
(1972)
Michael O. Rabin
Solving Linear Equations by Means of Scalar Products.
Complexity of Computer Computations
(1972)
Charles M. Fiduccia
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication.
Complexity of Computer Computations
(1972)
Michael J. Fischer
Efficiency of Equivalence Algorithms.
Complexity of Computer Computations
(1972)
Edward M. Reingold
,
A. Ian Stocks
Simple Proofs of Lower Bounds for Polynomial Evaluation.
Complexity of Computer Computations
(1972)
Shmuel Winograd
Parallel Iteration Methods.
Complexity of Computer Computations
(1972)
Richard P. Brent
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations.
Complexity of Computer Computations
(1972)
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, USA
Complexity of Computer Computations
(1972)
David C. van Voorhis
Toward a Lower Bound for Sorting Networks.
Complexity of Computer Computations
(1972)
Vaughan R. Pratt
Records Optimally in a Sequential Access File.
Complexity of Computer Computations
(1972)
Michael S. Paterson
Efficient Iterations for Algebraic Numbers.
Complexity of Computer Computations
(1972)
Richard M. Karp
Reducibility Among Combinatorial Problems.
Complexity of Computer Computations
(1972)
Robert W. Floyd
Permuting Information in Idealized Two-Level Storage.
Complexity of Computer Computations
(1972)
John E. Hopcroft
,
Robert Endre Tarjan
Isomorphism of Planar Graphs.
Complexity of Computer Computations
(1972)
Martin H. Schultz
The Computational Complexity of Elliptic Partial Differential Equations.
Complexity of Computer Computations
(1972)