generate questions: As Fortnow & Homer (2003) point out, the beginning of systematic studies in computational complexity is attributed to the seminal paper "On the Computational Complexity of Algorithms" by Juris Hartmanis and Richard Stearns (1965), which laid out the definitions of time and space complexity and proved the hierarchy theorems. Also, in 1965 Edmonds defined a "good" algorithm as one with running time bounded by a polynomial of the input size.
What paper is commonly considered the bellwether ushering in systematic studies computational complexity? {sep_token} What individuals were responsible for authoring "On the Computational Complexity of Algorithms"? {sep_token} In what year was Hatmanis and Stearn's seminal work in computational complexity received? {sep_token} What complex measurements were defined by "On the Computational Complexity of Algorithms"? {sep_token} In what year did Edmond's characterize a "good" algorithm? {sep_token}