Measuring the complexity of reductions between equivalence relations
Work
Year: 2018
Type: article
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 introduci... more
Source: Computability
Institution TU Wien
Cites: 33
Cited by: 7
Related to: 10
FWCI: 1.037
Citation percentile (by year/subfield): 66.93
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green