- Word
NP-complete
- Image
- Description
An NP-complete problem is one that is (1) in NP and (2) any other problem in NP can be translated, in polynomial time, into an instance of the given NP complete problem.
- Topics
- Computer Science, Mathematics, Computation
- Difficulty
- 1
