Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

1
  • 1
    $\begingroup$ The class P is not about algorithms but about problems decoded in languages. The correctly phrased statement would be: "I tell you that this algorithm for problem X runs in time $O(2^n)$ but yet $X$ is in P." It might therefore even be true if the algorithm runs in time $\Theta(2^n)$, the problem could be in P, if we pick an inefficient algorithm. $\endgroup$ Commented May 4, 2015 at 7:59