What does NP stands for in complexity classes theory?
(a) Non polynomial
(b) Non-deterministic polynomial
(c) Both (a) and (b)
(d) None of the mentioned
This question was addressed to me in class test.
My question is from Non Deterministic Polynomial Time in section Intractable Problems of Automata Theory