A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory

@article{Cook1997ATR,
  title={A Tight Relationship Between Generic Oracles and Type-2 Complexity Theory},
  author={Stephen A. Cook and Russell Impagliazzo and Tomoyuki Yamakami},
  journal={Inf. Comput.},
  year={1997},
  volume={137},
  pages={159-170}
}
We show that any two complexity classes satisfying some general conditions are distinct relative to a generic oracle i the corresponding type-2 classes are distinct. 3 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

The complexity of theorem-proving procedures, in \Proceedings

  • S. Cook
  • ACM Symposium on Theory of Computing",
  • 1971
Highly Influential
9 Excerpts

Type two computable functionals, in \Proceedings

  • R. L. Constable
  • ACM Symposium on Theory of Computing",
  • 1973
Highly Influential
4 Excerpts

The independence of the continuum hypothesis I, II, in \Proceedings

  • P. Cohen
  • Nat. Acad. Sci. U.S.A."
  • 1964
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…