On Sparse Oracles Separating Feasible Complexity Classes
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.contributor.author | Hemachandra, Lane A. | en_US |
| dc.date.accessioned | 2007-04-23T17:11:18Z | |
| dc.date.available | 2007-04-23T17:11:18Z | |
| dc.date.issued | 1985-10 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 1002446 bytes | |
| dc.format.extent | 301134 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-707 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6547 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On Sparse Oracles Separating Feasible Complexity Classes | en_US |
| dc.type | technical report | en_US |