Question

What does the complexity class P refer to?

A Problems that are easy to solve on deterministic Turing machines in polynomial time. Correct Answer Incorrect Answer
B Problems that are solvable in exponential time. Correct Answer Incorrect Answer
C Problems that are solvable in non-deterministic polynomial time. Correct Answer Incorrect Answer
D Problems that are solvable in logarithmic time. Correct Answer Incorrect Answer
E None of these Correct Answer Incorrect Answer

Solution

Problems that are easy to solve on deterministic Turing machines in polynomial time.

Practice Next

Relevant for Exams:

×
×