Question

a problem which does not have any polynomial time algorithm is called an
a) traceable b) efficient c) heuristics d) intractable
​

Answer 1

Answer:

Explanation: The worst-case efficiency of solving an problem in polynomial time is O(p(n)) where p(n) is the polynomial time of input size.