title: What does the time complexity n^(O(k)) signify?
body: <p>I came across a problem recently and read that it could be decided in time n^(O(k)) and that this still implies that the problem is in NP. What does this complexity represent? How is it a non-deterministic polynomial time complexity?</p>