<human>:  I have a question about the famous problem of P versus NP. When you say that a problem is NP-complete, what does that mean?
<bot>: NP-complete problems are problems that are easy to solve in polynomial time, but are hard to decide whether they are true or false. For example, the problem of determining whether a given Boolean formula is satisfiable is NP-complete.