I want to proof the P-Hardness of a language. Why is it enough to make a reduction-proof from an other, already P-Complete known language?
Proof of P-Hardness by reduction
complexity theory;reductions;polynomial time