<human>:  Who came up with the idea of NP-completeness?
<bot>: The idea was first proposed by Stephen Cook in 1978. The P vs NP problem is a problem that is considered to be equivalent to the question of whether there exists a polynomial time algorithm for solving NP-complete problems.