NP-complete

| 🗖 nosplit | ↑ parent "NP" | 21, 81, 3

🗖 nosplit | ⇓ toc | ↑ parent "NP" | Wikipedia | 21, 81, 3

A problem that is both NP and NP-hard.

Table of contents | 21, 81, 3
- 1. Cook-Levin theorem | 🔗 link | 🗖 nosplit | ↑ parent "NP-complete"
- 2. P versus NP problem (P vs NP) | 60, 60, 1 | 🔗 link | 🗖 nosplit | ↑ parent "NP-complete"
  - 2.1. Ladner’s Theorem | 🔗 link | 🗖 nosplit | ↑ parent "P versus NP problem"

Ancestors

NP | 9, 313, 8
Complexity class | 0, 313, 10
Computational problem | 15, 923, 20
Computer science | 240, 2k, 69
Computer | 136, 21k, 538
Technology | 0, 34k, 774
Ciro Santilli's Homepage | 238, 154k, 2k

Incoming links

BQP | 137
Integer factorization | 94, 185, 1
NP-intermediate | 58, 195, 1
P versus NP problem | 60, 60, 1