Archive Notes
Search
Search
Dark mode
Light mode
Reader mode
Explorer
Home
❯
University
❯
1. Glossary
❯
NP-complete
NP-complete
Jun 18, 2026
1 min read
A problem
X
is
NP-complete
if:
X
is also
NP-hard
X
also belongs to
NP
Graph View
Backlinks
2. Computable Functions & NP-completeness
4. Clique Problem
5. Hamiltonian Cycle Problem
1. The Cook-Levin Theorem
1. Introduction to SAT Solving