A non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial.
(a) true
(b) false
I had been asked this question in an interview for internship.
My question is taken from Checksum, Complexity Classes & NP Complete Problems topic in chapter Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II