Selected papers that cite this one
- Algirdas Avizienis. On the problem of computational time and complexity of arithmetic functions. In Conference Record of ACM Symposium on Theory of Computing, pages 255-258, Marina del Rey, California, 5-7 May 1969.
- A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 58(1-3):113-136, July/August/September 1983.
- K. Mount and S. Reiter. Approximation in a continuous model of computing. Journal of Complexity, 1(1):158-168, October 1985.
- J. E. Savage. Computational work and time on finite machines. Journal of the ACM, 19(4):660-674, October 1972.
- Philip M. Spira. The time required for group multiplication. Journal of the ACM, 16(2):235-243, April 1969.
- Philip M. Spira. On the computation time of certain classes of Boolean functions. In Conference Record of ACM Symposium on Theory of Computing, pages 271-272, Marina del Rey, California, 5-7 May 1969.
Selected references
- S. Winograd. On the time required to perform addition. Journal of the ACM, 12(2):277-285, April 1965.