On Restricting the Size of Oracles Compared with Restricting Access to Oracles
From MaRDI portal
Publication:3706504
Recommendations
Cited in
(19)- A positive relativization of polynomial time versus polylog space
- Tally NP sets and easy census functions.
- A note on sparse sets and the polynomial-time hierarchy
- On monotonous oracle machines
- Sparse Sets in : Relativizations
- Positive relativizations for log space computability
- scientific article; zbMATH DE number 4060725 (Why is no real title available?)
- Robust algorithms: a different approach to oracles
- Restricted information from nonadaptive queries to NP
- scientific article; zbMATH DE number 822206 (Why is no real title available?)
- On relativizations with restricted number of accesses to the oracle set
- scientific article; zbMATH DE number 4106269 (Why is no real title available?)
- Restricted relativizations of probabilistic polynomial time
- Reducibilities on tally and sparse sets
- Sets with small generalized Kolmogorov complexity
- On reductions of NP sets to sparse sets
- Bounded queries, approximations, and the Boolean hierarchy
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets
- On bounded query machines
This page was built for publication: On Restricting the Size of Oracles Compared with Restricting Access to Oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706504)