# Does NP-hardness imply P-hardness?

If a problem is NP-hard (using polynomial time reductions), does that imply that it is P-hard (using log space or NC reductions)? It seems intuitive that if it is as hard as any problem in NP that it should be as hard as any problem in P, but I don't see how to chain the reductions and get a log space (or NC) reduction.

• This holds if you use the same kind of reductions for both sides, e.g. a $\mathbf{NP-hard}$ problem w.r.t. log-space reductions is also $\mathbf{P-hard}$ w.r.t. log-space reductions. Mar 10, 2011 at 8:26
• i.e. your intuition is correct but the question you have asked asks for more than that (since you are using different kinds of reduction). Mar 10, 2011 at 9:15
• The most important part of the question is which notions of reducibility you use, but this information is somehow put in parentheses as if it is the least important information! Mar 10, 2011 at 11:57

No such implication is known. In particular it may be that $L \ne P = NP$ in which case all problems (including trivial ones) are NP-hard under poly-time reductions (as the reduction can just solve the problem), but trivial ones (in particular ones that lie in L) are surely not P-hard under logspace reductions (as otherwise L=P).