A result relating disjunctive self-reducibility to P-immunity
DOI10.1016/0020-0190(90)90191-YzbMATH Open0702.68053OpenAlexW2100820536MaRDI QIDQ915447FDOQ915447
Authors: Jürgen Kämper 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90191-y
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- On helping by robust oracle machines
- Title not available (Why is that?)
- On self-reducibility and weak P-selectivity
- Tally languages and complexity classes
- On sparse sets in NP-P
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Immunity, Relativizations, and Nondeterminism
- Bi-immune sets for complexity classes
- Oracle-dependent properties of the lattice of NP sets
- Title not available (Why is that?)
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Simplicity, Relativizations and Nondeterminism
- Title not available (Why is that?)
- Immunity and simplicity in relativizations of probabilistic complexity classes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A result relating disjunctive self-reducibility to P-immunity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915447)
