Positive relativizations for log space computability

DOI10.1016/0304-3975(90)90168-HzbMath0718.68039OpenAlexW2071339347MaRDI QIDQ2639638

Seinosuke Toda

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90168-h

zbMATH Keywords

polynomial-time computabilityoracle Turing machineslog-space bounded Turing machinespositive relativizations

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Qualitative relativizations of complexity classes
• Space-bounded hierarchies and probabilistic computations
• Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\)
• Bounded query machines: on NP( ) and NPQUERY( )
• A second step toward the polynomial hierarchy
• Relationships between nondeterministic and deterministic tape complexities
• A note on relativized log space
• Positive Relativizations of Complexity Classes
• On Restricting the Size of Oracles Compared with Restricting Access to Oracles
• Quantitative Relativizations of Complexity Classes
• RelativizedNC
• Alternation
• Relativizing Time, Space, and Time-Space
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Relativization of questions about log space computability