Oracle constructions have long been used to provide evidence that certain questions in complexity theory cannot be resolved using the usual techniques of simulation and diagonalization. However, the existence of nonrelativizing proof techniques seems to call this practice into question. This paper reviews the status of nonrelativizing proof techniques, and argues that many oracle constructions still yield valuable information about problems in complexity theory.
CITATION STYLE
Allender, E. (1990). Oracles versus proof techniques that do not relativize. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 450 LNCS, pp. 39–52). Springer Verlag. https://doi.org/10.1007/3-540-52921-7_54
Mendeley helps you to discover research relevant for your work.