Definitionintro
NP-hard
Also called NP-hard problem, NP-hardness.
A problem is NP-hard if every problem in NP reduces to it in polynomial time.
A problem is NP-hard if every problem in NP reduces to it in polynomial time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag TJETK7 Edit this page History Report an error