O'Reilly logo

Theory of Computational Complexity, 2nd Edition by Ker-I Ko, Ding-Zhu Du

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

4.7 Random Oracles

Consider the class c04-math-0835 of all subsets of c04-math-0836 and define subclasses c04-math-0837 and c04-math-0838. One of the approaches to study the relativized c04-math-0839 question is to compare the two subclasses c04-math-0840 and c04-math-0841 to see which one is larger. In this subsection, we give a brief introduction to this study based on the probability theory on the space c04-math-0842.

To define the notion of probability on the space c04-math-0843, it is most convenient to identify each element c04-math-0844 with its characteristic sequence (i.e., the kth bit of αX is 1 if and only if ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required