Complexity Of Computations

Authors:
Shmuel Winograd
Affiliations:
-
Venue:
ACM '78 Proceedings of the 1978 annual conference
Year:
1978

Citing 5
Cited 1

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
P-Complete Approximation Problems

Journal of the ACM (JACM)
Complexity of computations

Communications of the ACM
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Cited References

Computer algebra handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

Construction of algorithms is a time honored mathematical activity. Euclid's algorithm for finding the greatest common divisor of two integers, as well as the many constructions by a ruler and compass are some of the fruits of the search for algorithms by the Greek mathematicians. In our days, we have the whole field of Numerical Analysis devoted to finding a variety of algorithms for numerical integration of differential equations.