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.