NP-hard
complexity class
Facts
3 properties- Instance of
- complexity class
- Subclass of
- computational problem[2]
- Has part(s)
- NP-complete, NP-equivalent[3][4]
🏷️ Also known as
en NP-hard
ar مسائل NP صعبة
cs NP-těžký
cs NP-těžkost
de NP-hard
de NP-Härte
de NP-Schwere
es NP dificil
es NP complejo
es NP-complejo
es NP-dificil
es NP difícil
es NP-difícil
es NP hard
fa انپی سخت
fa ان پی سخت
fr problème NP-difficile
he NP-קשיות
hu NP-nehéz
it NP-arduo
🔖 Identifiers · 8
- Encyclopedia of China (Third Edition) ID (2026)
- yanVh
- Encyclopedia of China (Third Edition) old ID (2021)
- 322923
- Encyclopædia Britannica Online ID
- topic/NP-hard-problem
- Freebase ID
- /m/0f86q
- MathWorld ID
- NP-HardProblem
- Quora topic ID
- NP-Hard-1
- Stack Exchange tag
- cs.stackexchange.com, stackoverflow.com
- Topic's main category
- Category:NP-hard problems
🔗 Connections
Has part(s) 1
Has these parts 1
Instance of 1
Maintained by WikiProject 1
Subclass of 1
Topic's main category 1
← Category's main topic 1
← Computational complexity 1
Press Enter · cited answer in seconds
0 sources
Summary
NP-hard is a complexity class[1].