A problem (not necessarily in the complexity class C) is C-hard if every problem in C can be reduced to it in polynomial time.