Self-reducible sets of small density
Document typeExternal research report
Rights accessOpen Access
We study the complexity of sets that are at the same time self-reducible and sparse or m-reducible to sparse sets. We show that sets of this kind are low for the complexity clases [delta sub 2 super p], [fi sub 2 super p], NP or P, depending on the type of self-reducibility used and on certain restrictions imposed on the query mechanism of the self-reducibility machines. The proof of some of these results is based on graph theoretic properties that hold for the graphs induced by the self-reducibility structures.
CitationLozano, A.; Toran, J. "Self-reducible sets of small density". 1989.
Is part ofLSI-89-27