We present in this note a rather new way to cope with polynomial inapproximability of NP-hard problems. We study approximation of min coloring by moderately exponential time algorithms, able to achieve approximation ratios unachievable in polynomial time for min coloring by algorithms with provably upper complexity bounds, better than those of exact resolution.