J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90.

1967 ◽  
Vol 32 (1) ◽  
pp. 121-122
Author(s):  
Jiří Bečvář
Sign in / Sign up

Export Citation Format

Share Document