Measuring the complexity of reductions between equivalence relations
Measuring the complexity of reductions between equivalence relations is a scholarly work, published in 2019 in ''Computability''. The main subjects of the publication include logic programming, automata theory, and computational complexity theory. The authors\ngeneralize computable reducibility by introducing degree spectra of\nreducibility and bi-reducibility.