I remember reading up on Karp's 21 problems paper and encountering the paper from Cook that established that boolean satisfiability was NP complete. It was published in ACM, very glad that it's available now: https://dl.acm.org/doi/pdf/10.1145/800157.805047