Which of the following can be used to define NP complexity class?
(a) Verifier
(b) Polynomial time
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked during an internship interview.
This interesting question is from Non Deterministic Polynomial Time topic in chapter Intractable Problems of Automata Theory