Rare card
NP-hardness
- Value
- 50 W
- Attack
- 247
- Defence
- 197
- Players
- 0
In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time, there is a polynomial-time reduction from L to H.
Get NP-hardness in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack