<human>:  Who came up with the idea of NP-completeness?
<bot>: The idea was first proposed by Stephen Cook in 1978. The idea was that NP-complete problems are the hardest problems that can be solved in polynomial time. This means that there is a polynomial time algorithm for solving them, but not necessarily a faster one.