Which of the following options are correct with reference to P-complete problems?
(a) used for the problems which are difficult to solve in limited space
(b) every problem in P can be reduced to it using proper reductions
(c) complete problem for complexity class P
(d) all of the mentioned
I have been asked this question in quiz.
The question is from Problem Solvable in Polynomial Time in section Intractable Problems of Automata Theory