"On the Computational Complexity of Algorithms" in Transactions of the American Mathematical Society, Volume 117, Issue 5, May 1965, pp. 285-306
Providence: American Mathematical Society, 1965. 1st Edition. FIRST EDITION IN ORIGINAL WRAPS OF THE FOUNDING PAPER ON COMPUTATIONAL COMPLEXITY. Juris Hartmanis and Richard Stearns, both prominent computer scientists and computational theorists "became interested in how much time and memory are needed to perform different computations -- a field that they... More