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
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
