1. Bootstrapped with SAT by Cook (1971).
2. Proved and extended to 21 problems by Karp (1972).

[Both seminal papers yielded Turing Awards.]

The bootstrapping is due to

the Cook-Levin¹ theorem,

or just Cook’s theorem.