A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Lowness and the complexity of sparse and tally descriptions
2016
We investigate the complexity of obtaining sparse descriptions for sets in various reduction classes to sparse sets. Let A be a set in a certain reduction class R(SPARSE) to the class of sparse sets. Then we are interested in finding upper bounds for the complexity (relative to A) of sparse sets S such that A is in R(S). By establishing such upper bounds we are able to derive the lowness of A. In particular, we show that the closure of sparse sets under bounded truth-table reductions (as well
doi:10.18725/oparu-1059
fatcat:4u4m53tqjndbbdqfnk3o7djhxu