Jump to navigation Jump to search
|This is a stub or unfinished. Contribute by editing me.|
NP-Complete is a class of problems that are the hardest of those in NP.
A problem is considered to be NP-complete if:
- It is in NP.
- All other problems in NP are reducible to it. (The problem is NP-hard.)