Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles

DOI10.1137/0217038zbMATH Open0652.68056OpenAlexW2089767782MaRDI QIDQ3798239FDOQ3798239

Timothy J. Long

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0217038

zbMATH Keywords

sparse setstally setspolynomial-time hierarchylanguage classesnondeterministic oracle programsnondeterministic polynomial-time oracle machinesrestricted relativization of NP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (1)

• The strong exponential hierarchy collapses

This page was built for publication: Erratum: 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 Q3798239)