P-immune sets with holes lack self-reducibility properties

Authors:
Lane A. Hemaspaandra;Harald Hempel
Affiliations:
Department of Computer Science, University of Rochester, Rochester, NY;Institut für Informatik, Friedrich-Schiller-Universität Jena, Am Leutragraben 1, D-07743 Jena, Germany
Venue:
Theoretical Computer Science
Year:
2003

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Structural complexity 1

Structural complexity 1
A result relating disjunctive self-reducibility to P-immunity

Information Processing Letters
Self-reducibility

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Easily Checked Generalized Self-Reducibility

SIAM Journal on Computing
On Disjunctive Self-Reducibility

CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Some connections between nonuniform and uniform complexity classes

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Hi-index	5.23

No P-immune set having exponential gaps is positive-Turing self-reducible.