In theoretical computer science, P versus NP is a major unsolved problem in computational complexity theory. The idea asks: does being able to quickly recognise correct answers (NP) mean there’s a quick way to find them (P)?
Computer scientists generally regard .
Any fast algorithm to solve NP-complete problems can be used to solve any problem in NP, i.e., the NP class would collapse into P.
Resources
- P vs. NP and the Computational Complexity Zoo, a great introductory resource