We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.