Beta Phase:
Square45 is currently in beta testing. Expect some features or content to be incomplete or missing.
45
English
Français
العربية
Deutsch
🏠
/
Computer Science
/
Analysis of Algorithms
/
NP-Complete
NP-Complete
A class of problems that are the hardest problems in NP.
📜
The statement of the theorem
A problem
L
L
L
is NP-complete if
L
∈
N
P
L \in NP
L
∈
NP
and every problem in
N
P
NP
NP
is reducible to
L
L
L
in polynomial time.