J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 (1965), pp. 285–306.

1967 ◽  
Vol 32 (1) ◽  
pp. 120-121
Author(s):  
Jiří Bečvář
2021 ◽  
Vol 126 (5) ◽  
pp. 3853-3870
Author(s):  
Lawrence Smolinsky ◽  
Daniel S. Sage ◽  
Aaron J. Lercher ◽  
Aaron Cao

Science ◽  
1922 ◽  
Vol 55 (1431) ◽  
pp. 600-602
Author(s):  
R. G. D. Richardson

Sign in / Sign up

Export Citation Format

Share Document