A positive relativization of polynomial time versus polylog space

DOI10.1016/0020-0190(93)90056-FzbMath0774.68043OpenAlexW1985889075MaRDI QIDQ1261484

Ricard Gavaldà

Publication date: 3 October 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90056-f

zbMATH Keywords

relativization\(P\) versus PLOG

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sparse sets in NP-P
• Translational lemmas, polynomial time, and \((\log n)^j\)-space
• On Restricting the Size of Oracles Compared with Restricting Access to Oracles
• Tally languages and complexity classes

This page was built for publication: A positive relativization of polynomial time versus polylog space