eCommons

 

On Sparse Oracles Separating Feasible Complexity Classes

dc.contributor.authorHartmanis, Jurisen_US
dc.contributor.authorHemachandra, Lane A.en_US
dc.date.accessioned2007-04-23T17:11:18Z
dc.date.available2007-04-23T17:11:18Z
dc.date.issued1985-10en_US
dc.description.abstractThis 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.en_US
dc.format.extent1002446 bytes
dc.format.extent301134 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-707en_US
dc.identifier.urihttps://hdl.handle.net/1813/6547
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn Sparse Oracles Separating Feasible Complexity Classesen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
85-707.pdf
Size:
978.95 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
85-707.ps
Size:
294.08 KB
Format:
Postscript Files