The complexity class P consist of all the decision problems that can be solved by ___________using polynomial amount of computation time.
(a) Push Down automata
(b) DFA
(c) NDFA
(d) Deterministic Turing machine
The question was asked during an interview.
This is a very interesting question from Problem Solvable in Polynomial Time topic in section Intractable Problems of Automata Theory