Complexity of computations

Authors:
Michael O. Rabin
Affiliations:
Hebrew University of Jerusalem
Venue:
ACM Turing award lectures
Year:
2007

Citing 5
Cited 0

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
On the Addition of Binary Numbers

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

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.