홈 > 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
