A result relating disjunctive self-reducibility to P-immunity
From MaRDI portal
Publication:915447
Recommendations
Cites work
- scientific article; zbMATH DE number 4179363 (Why is no real title available?)
- scientific article; zbMATH DE number 3936519 (Why is no real title available?)
- scientific article; zbMATH DE number 4090801 (Why is no real title available?)
- scientific article; zbMATH DE number 3594673 (Why is no real title available?)
- scientific article; zbMATH DE number 817509 (Why is no real title available?)
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
- Bi-immune sets for complexity classes
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Immunity and simplicity in relativizations of probabilistic complexity classes
- Immunity, Relativizations, and Nondeterminism
- On helping by robust oracle machines
- On self-reducibility and weak P-selectivity
- On sparse sets in NP-P
- Oracle-dependent properties of the lattice of NP sets
- Simplicity, Relativizations and Nondeterminism
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- Tally languages and complexity classes
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)