Question

What does the complexity class P refer to?

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

Relevant for Exams:

Hey! Ask a query