<human>:  Who came up with the idea of NP-completeness?
<bot>: The idea was first proposed by Stephen Cook in 1978. Cook proposed that all problems in NP are reducible to each other. Cook called the class of problems in NP "NP-complete".