Complexity of computations

Authors:
Michael O. Rabin
Affiliations:
Hebrew Univ. of Jerusalem, Jerusalem, Israel
Venue:
Communications of the ACM
Year:
1977

Citing 4
Cited 5

On the Time Required to Perform Addition

Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION

AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION

Cryptology in Transition

ACM Computing Surveys (CSUR)
An overview of computational complexity

Communications of the ACM
Complexity Of Computations

ACM '78 Proceedings of the 1978 annual conference
The nested rectangular array as a model of data

APL '79 Proceedings of the international conference on APL: part 1
An overview of computational complexity

ACM Turing award lectures

Quantified Score

Hi-index	48.23

Visualization

Abstract

The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.