_________ is the class of decision problems that can be solved by non-deterministic polynomial algorithms.
(a) NP
(b) P
(c) Hard
(d) Complete
I had been asked this question during an online interview.
I'd like to ask this question from Checksum, Complexity Classes & NP Complete Problems in division Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II