College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||On Sparse Oracles Separating Feasible Complexity Classes|
|Authors: ||Hartmanis, Juris|
Hemachandra, Lane A.
|Keywords: ||computer science|
|Issue Date: ||Oct-1985|
|Publisher: ||Cornell University|
|Abstract: ||This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to the study and characterization of the class of oracles achieving a specified relativization. Results of this type have the potential to yield deeper insights into the nature of relativization problems and focus our attention on new and interesting classes of languages. A complete and transparent characterization of oracles that separate NP from P would resolve the long-standing P =? NP question. In this note, we settle a central case. We fully characterize the sparse oracles separating NP from P in worlds where P = NP. We display related results about coNP, E, NE, coNE, and PSPACE.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.