@article {fokina2018,
	title = {Measuring the Complexity of Reductions between Equivalence Relations},
	journal = {Computability},
	volume = {Preprint},
	number = {Preprint},
	year = {2018},
	pages = {1-16},
	abstract = {Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibil},
	issn = {2211-3568},
	doi = {10.3233/COM-180100},
	url = {https://arxiv.org/abs/1806.10363},
	author = {Fokina, Ekaterina and Rossegger, Dino and San Mauro, Luca}
}
