Michael O. Rabin
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.
- 1 Blum, M, A machine independent theory of the complexity of recursive functions. J. ACM 14 (1967), 322-336. Google Scholar
Digital Library
- 2 Brent, R,P. On the addition of binary numbers. IEEE Trans. Comptrs. C-19 (1970), 758-759.Google ScholarDigital Library
- 3 Brent, R.P. The parallel evaluation of algebraic expressions in logarithmic time. Complexity of Sequential and Parallel Numerical Algorithms, J.F. Traub, Ed., Academic Press, New York, 1973, pp. 83-102.Google Scholar
- 4 Cook, S.A. The complexity of theorem proving procedures. Proc. Third Annual ACM Symp. on Theory of Comptng., 1971, pp. 151-158. Google ScholarDigital Library
- 5 Fischer, M.J., and Rabin, M.O. Super-exponential complexity of Presburger arithmetic. In Complexity of Computations (SIAM- AMS Proc., Vol. 7), R.M. Karp Ed., 1974, pp. 27-41.Google Scholar
- 6 Floyd, R.W. Permuting information in idealized two-level storage. In Complexity of Computer Computations, R. Miller and J. Thatcher Eds., Plenum Press, New York, 1972, pp. 105-109.Google ScholarCross Ref
- 7 Karp, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. Miller and J. Thatcher Eds., Plenum Press, New York, 1972, pp. 85-103.Google ScholarCross Ref
- 8 Meyer, A.R. The inherent computational complexity of theories of order. Proc. Int. Cong. Math., Vol. 2, Vancouver, 1974, pp. 477- 482.Google Scholar
- 9 Motzkin, T.S. Evaluation of polynomials and evaluation of rational functions. Bull. Amer. Math. Soc. 61 (1955), 163.Google Scholar
- 10 Munro, I., and Paterson, M. Optimal algorithms for parallel polynomial evaluation. J. Comptr. Syst. Sci., 7 (1973), 189-198.Google ScholarDigital Library
- 11 Paterson, M., Fischer, M.J., and Meyer, A.R. An improved overlap argument for on-line multiplication. Proj. MAC Tech. Report 40, M.I.T. (1974). Google ScholarDigital Library
- 12 Presburger, M. Uber die Vollstfindigkeit eines gewissea Systems Arithmetic ganzer Zahlen in welchem die Addition als eiilzige Operation hervortritt. Comptes-rendus du I Congr~s de Mathematiciens de Pays Slaves, Warsaw, 1930, pp. 92-101,395.Google Scholar
- 13 Rabin, M.O. Speed of computation and classification of recursive sets. Third Convention Sci. Soc., Israel, 1959, pp. 1-2.Google Scholar
- 14 Rabin, M.O. Degree of difficulty of computing a function and a partial ordering of recursive sets. Tech. Rep. No. 1, O.N,R., Jerusalem, 1960.Google Scholar
- 15 Rabin, M.O. Probabilistic algorithms. In Algorithms and Complexity, New Directions and Recent Trends, J .F. Traub Ed., Academic Press, New York, 1976, pp. 21-39.Google Scholar
- 16 Sch6nhage, A., and Strassen, V. Schnelle Multiplication grosser Zahlen. Computing 7 (1971), 281-292.Google ScholarCross Ref
- 17 Strassen, V. Gaussian elimination is not optimal. Num. Math. 13 (1969), 354-356.Google ScholarDigital Library
- 18 Valiant, L.G. General context-free recognition in less than cubic time. Rep., Dept. Comptr. Sci., Carnegie-Mellon U., Pittsburgh, Pa., 1974.Google Scholar
- 19 Winograd, S. On the time required to perform addition. J. ACM 12 (1965), 277-285. Google ScholarDigital Library
- 20 Winograd, S. On computing the discrete Fourier transform. Proc. Natl. Acad. Sci. USA 73 (1976), 1005-1006.Google ScholarCross Ref
Index Terms
-
Complexity of computations
-
Recommendations
-
Complexity of computations
ACM Turing award lecturesThe 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 ...
-
Kolmogorov Complexity for Possibly Infinite Computations
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired ...
-
Decision versus evaluation in algebraic complexity
MCU'07: Proceedings of the 5th international conference on Machines, computations, and universalityThis is a survey of some of my joint work with Sylvain Périfel. It is focused on transfer theorems that connect boolean complexity to algebraic complexity in the Valiant and Blum-Shub-Smale models.
Comments