NP-complete | 🗖 nosplit | ↑ parent "NP" | 19, 3, 75

🗖 nosplit | ⇓ toc | ↑ parent "NP" | Wikipedia | 19, 3, 75

A problem that is both NP and NP-hard.

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

Incoming links