If the number of steps required to solve a problem is O(n^k), then the problem is said to be solved in:
(a) non-polynomial time
(b) polynomial time
(c) infinite time
(d) none of the mentioned
I had been asked this question in a national level competition.
My doubt is from Problem Solvable in Polynomial Time in division Intractable Problems of Automata Theory