What paper is commonly considered the bellwether ushering in systematic studies computational complexity?
Also, in 1965 Edmonds defined a "good" algorithm as one with running time bounded by a polynomial of the input size.