There are a lot of problems that a computer can solve quickly, we've called them P.
But there are some we don't know if a computer can solve quickly. If someone already has an answer a computer can quickly check if it's the right answer though. These problems are called NP.
Some problems we know are at least as hard as any other NP problem we've come across, these we call NP-hard. Solving any one of these NP-hard problems means that we can solve all the other NP-hard and NP problems.
There are a lot of problems that a computer can solve quickly, we've called them
P.But there are some we don't know if a computer can solve quickly. If someone already has an answer a computer can quickly check if it's the right answer though. These problems are called
NP.Some problems we know are at least as hard as any other
NPproblem we've come across, these we callNP-hard. Solving any one of theseNP-hardproblems means that we can solve all the otherNP-hardandNPproblems.Wow, thanks for answering. This also makes sense a lot for layman (or 5-year-old)'s term.