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.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
-
(Gold) 1123 poin - 100% positive feedback
