is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
|Answer» A. np|
|Explanation: np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms.|
Login to Continue
It will take less than 2 minutes