ホーム > 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
