<human>:  Who came up with the idea of NP-completeness?
<bot>: The idea was first proposed by Stephen Cook in 1978. The idea is that a problem is NP-complete if there exists a polynomial-time algorithm that solves the problem, but no non-deterministic polynomial-time algorithm can solve the problem.