I want to test the ability of students to read a passage and answer questions about it. Could you please come up with a good question for the passage "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."? 

Who produced a work closer to 1995, Fortnow & Homer or Juris Hartmanis and Richard Stearns?