Comment: Re:What, exactly, is 3-SAT? (Score 1) 700
Correction: the big-Oh should be O(m*n^c), where c is a number that does not increase with the complexity of the input, though `n` and 'm' may.
Not quite. Problems in the set P mean they are solvable in polynomial time O(mn^c), where n is the size of the input and m and c are constants. m and n do not increase with the complexity of the input. They have a constant upper bound regardless of input size or complexity. If your m or n is increasing, you may be hiding an exponential term (c^n) within that function.