Open AccessOn sparse oracles separating feasible complexity classes
Author(s) -
Juris Hartmanis,
Lane A. Hemachandra
Publication year - 1986
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/3-540-16078-7_86
Subject(s) - computer science , pspace , focus (optics) , characterization (materials science) , class (philosophy) , complexity class , theoretical computer science , computational complexity theory , p , time complexity , algorithm , artificial intelligence , physics , materials science , optics , nanotechnology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom