On relativizations with restricted number of accesses to the oracle set
From MaRDI portal
Publication:3779739
Recommendations
Cites work
- scientific article; zbMATH DE number 3823755 (Why is no real title available?)
- scientific article; zbMATH DE number 4070309 (Why is no real title available?)
- scientific article; zbMATH DE number 4099277 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Lowness Properties of Sets in the Exponential-Time Hierarchy
- Positive Relativizations of Complexity Classes
- Qualitative relativizations of complexity classes
- Quantitative Relativizations of Complexity Classes
- Relative complexity of checking and evaluating
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Cited in
(10)- Relativized collapsing between BPP and PH under stringent oracle access
- On relativized nondeterministic polynomial-time bounded computations
- On Restricting the Size of Oracles Compared with Restricting Access to Oracles
- Oracle‐Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP
- scientific article; zbMATH DE number 4060725 (Why is no real title available?)
- On problems for which no oracle can help
- On the cutting edge of relativization: the resource bounded injury method
- The Isomorphism Conjecture Holds Relative to an Oracle
- On monotonous oracle machines
- Query complexity, or why is it difficult to separate NP^ A coNP^ A from P^ A by random oracles A?
This page was built for publication: On relativizations with restricted number of accesses to the oracle set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779739)
