<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 asks whether there exists a polynomial time algorithm that can solve every problem in NP. The P vs NP problem is one of the most famous problems in computer science, and is considered one of the most important unsolved problems in mathematics.