NP-complete
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
A subclass of NP is NP-complete when any problem in NP can be reduced, or transformed in polynomial time, into a member of the class. Hundreds of NP-complete problems have been identified; there is a wikipedia:list of NP-complete problems.