A positive relativization of polynomial time versus polylog space
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4060720 (Why is no real title available?)
- scientific article; zbMATH DE number 18632 (Why is no real title available?)
- scientific article; zbMATH DE number 46423 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- On Restricting the Size of Oracles Compared with Restricting Access to Oracles
- On sparse sets in NP-P
- Tally languages and complexity classes
- Translational lemmas, polynomial time, and \((\log n)^j\)-space
Cited in
(7)- Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n) NSPACE( \,n)
- Supportive oracles for parameterized polynomial-time sub-linear-space computations in relation to L, NL, and P
- Positive relativizations for log space computability
- A time-space hierarchy between polynomial time and polynomial space
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
- Bandwidth constraints on problems complete for polynomial time
This page was built for publication: A positive relativization of polynomial time versus polylog space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261484)
