The study of the complexity of equivalence relations has recently been (somewhat) active, with computable, c.e. and other equivalence relations higher up the arithmetical hierarchy being the objects of study. The main reducibility amongst equivalence relations is given by the usual m-reducibility. This gives a natural way of comparing equivalence relations. We survey some recent results in this topic, including completeness results, results on other possible reducibilities and applications.