A problem such that all NP problems can be reduced in polynomial time to it.
- NP | 9, 313, 8
- Complexity class | 0, 313, 10
- Computational problem | 15, 923, 20
- Computer science | 240, 2k, 70
- Computer | 136, 22k, 571
- Technology | 0, 36k, 847
- Ciro Santilli's Homepage | 238, 163k, 3k
- NP-complete | 21, 81, 3