What is the P vs NP Problem?

In this episode, Dr. Know-it-all discusses Millennium Prize question of P vs NP: Can a "hard" (NP--or Non-Polynomial--Complete) problem be solved in "easy" (P, or Polynomial) time if one can easily check the solution? Check out his answer, and set your sites on winning the $1million if you can prove P = NP or P doesn't = NP!

Here are some good links to learn more about the P vs NP problem.
NP problems and Polynomial time: Fortnow, Lance (2013). The Golden Ticket: P, NP, and the Search for the Impossible. Princeton, NJ: Princeton University Press. ISBN 9780691156491

Be sure to subscribe, and be sure to ask questions for Dr. Know-it-all in the comments (or at drknowitallknows at gmail)--anything from the mundane to the esoteric is fair game. See what his off-the-cuff answer is, and if it's right or wrong!

[steve--smith]

Np = Non deterministic polynomial time not non polynomial time

[BongoWongoOG]

Never mind the statistics, where were your glasses? Totally threw me lol