Definition : The complexity class of decision problems for which answers can be checked by an algorithm whose run time is polynomial in the size of the input.
確定！ 回上一頁
