In the world of theoretical computer science, P vs. NP is something of a mythical unicorn. It's become notorious, since it remains an unsolved problem. It basically asks this: If it is easy to check that a solution to a problem is correct, is it also easy to solve that problem? Get back to us when you have an answer.
Why Is This So Hard?
Who Wants To Be A Millionaire—From Math?
Watch And Learn: Our Favorite Content About Unsolved Problems
Why Is P vs. NP Important?
Share the knowledge!
Written by Curiosity Staff March 7, 2017
Wake up with the smartest email in your inbox.
Our best articles a few times a week.