default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComplexity of Computer Computations 1972: Yorktown Heights, NY, USA
- Raymond E. Miller, James W. Thatcher:
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. The IBM Research Symposia Series, Plenum Press, New York 1972, ISBN 0-306-30707-3 - Volker Strassen:
Evaluation of Rational Functions. 1-10 - Michael O. Rabin:
Solving Linear Equations by Means of Scalar Products. 11-20 - Edward M. Reingold, A. Ian Stocks:
Simple Proofs of Lower Bounds for Polynomial Evaluation. 21-30 - Charles M. Fiduccia:
On Obtaining Upper Bounds on the Complexity of Matrix Multiplication. 31-40 - Michael S. Paterson:
Efficient Iterations for Algebraic Numbers. 41-52 - Shmuel Winograd:
Parallel Iteration Methods. 53-60 - Richard P. Brent
:
The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations. 61-71 - Martin H. Schultz:
The Computational Complexity of Elliptic Partial Differential Equations. 73-83 - Richard M. Karp:
Reducibility Among Combinatorial Problems. 85-103 - Robert W. Floyd:
Permuting Information in Idealized Two-Level Storage. 105-109 - Vaughan R. Pratt:
An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File. 111-118 - David C. van Voorhis:
Toward a Lower Bound for Sorting Networks. 119-129 - John E. Hopcroft, Robert Endre Tarjan:
Isomorphism of Planar Graphs. 131-152 - Michael J. Fischer:
Efficiency of Equivalence Algorithms. 153-167
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
