Intermediate
Theory of Computation
Q51 / 100
What is the complexity class P?
Correct! Well done.
Incorrect.
The correct answer is B) Problems decidable by a deterministic TM in polynomial time in the input size
B
Correct Answer
Problems decidable by a deterministic TM in polynomial time in the input size
Explanation
P contains problems solvable in O(nᵏ) time for some constant k. Examples: sorting, shortest paths, linear programming. P is believed to be a strict subset of NP.
Progress
51/100