Possible Duplicate:
Do many-one reductions and Turing reductions define the same class NPC
Hi,
Is the following true:
If L is coNP-hard, then L is NP-hard.
I have found statements of this, but no proofs, so, a reference would be greatly appreciated.
Thank you!
--Katherine