Two oracles that force a big crunch

DOI10.1007/S00037-001-8190-2zbMATH Open0991.68023OpenAlexW2095233625MaRDI QIDQ5957723FDOQ5957723

Authors: Harry Buhrman, S. Fenner, Lance Fortnow, Leen Torenvliet 

Publication date: 5 May 2002

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-001-8190-2

Recommendations

• Beyond \(\mathbf{P}^{\mathbf{NP}}=\mathbf{NEXP}\)
• On the cutting edge of relativization: The resource bounded injury method
• scientific article; zbMATH DE number 1775405
• scientific article; zbMATH DE number 3926244
• scientific article; zbMATH DE number 4074484

zbMATH Keywords

oracle

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• A good oracle is hard to beat
• What would be outcome of a Big Crunch?

This page was built for publication: Two oracles that force a big crunch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957723)