الصفحة الرئيسية > Term: strongly NP-hard
strongly NP-hard
The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input.
- قسم من أقسام الكلام: noun
- المجال / النطاق: علم الكمبيوتر
- الفئة: Algorithms & data structures
- Government Agency: NIST
0
المنشئ
- GeorgeV
-
(Gold) 1123 النقاط - 100% positive feedback
