Home > 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
- Κλάδος/Τομέας: Υπολογιστές
- Category: Αλγόριθμοι & δομές
- Government Agency: NIST
0
Δημιουργός
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
