What individuals were responsible for authoring "On the Computational Complexity of Algorithms"?
Also, in 1965 Edmonds defined a "good" algorithm as one with running time bounded by a polynomial of the input size.