Additional Key Words and Phrases: computation complexity, logic circuits, logical design, finite-state automata, finite functions, group, addition, multiplication
Selected papers that cite this one
- 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.
- S. Winograd. On the time required to perform multiplication. Journal of the ACM, 14(4):793-802, October 1967.