Sparse sets in NP-P: relativizations
SIAM Journal on Computing
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Complexity classes without machines: on complete languages for UP
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Proc. of the conference on Structure in complexity theory
The Boolean hierarchy: hardware over NP
Proc. of the conference on Structure in complexity theory
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Random oracles separate PSPACE from the polynomial-time hierarchy
Information Processing Letters
Proceedings of the 11th Colloquium on Automata, Languages and Programming
On Complete Problems for NP$\cap$CoNP
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Parity, circuits, and the polynomial-time hierarchy
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Exact time bounds for computing boolean functions on PRAMs without simultaneous writes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Resource-Bounded Continuity and Sequentiality for Type-Two Functionals
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The computational complexity of game trees by eigen-distribution
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
On black-box separations among injective one-way functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
ACM Transactions on Computation Theory (TOCT)
Improved bounds for the randomized decision tree complexity of recursive majority
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Properties and applications of boolean function composition
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we examine various complexity issues relative to an oracle for a generic set in order to determine which are the more "natural" conjectures for these issues. Generic oracle results should be viewed as parallels to random oracle results, as in [BG]; the two are in many ways related, but, as we shall exhibit, not equivalent. Looking at computation relative to a generic oracle is in some ways a better reflection of computation without an oracle; for example, whereas adding a random oracle allows a deterministic polynomial-time machine to solve any problem in BPP, adding a generic oracle will not help solve any recursive problem faster than it could be solved without an oracle. Generic sets were first introduced by Cohen as a tool for proving independence results in set theory [Co]. Their recursion theoretic properties have also been explored in depth; for example, see [J] and [Ku2]. Some related work using forcing and/or generic sets as tools in oracle constructions can be found in [Ku3], [Do], [P], and [A-SFH]. However, this is to our knowledge the first knowledge the first thorough examination of complexity relative to a generic Oracle.