AI engineering glossary · Data structures algorithms
What is P versus NP?
P versus NP: The open question of whether every problem whose proposed answer can be checked quickly (in polynomial time) can also be solved quickly. Most experts believe not, but it is unproven, and it shapes how we judge hard problems.
P versus NP: an example
Checking a given Sudoku solution is fast, but no known method solves every large puzzle quickly, and nobody has proved that none exists.
Related terms
More Data structures algorithms terms
Where you learn it
P versus NP is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.