Skip to Main Content
Theory of Computational Complexity, 2nd Edition
book

Theory of Computational Complexity, 2nd Edition

by Ding-Zhu Du, Ker-I Ko
June 2014
Intermediate to advanced content levelIntermediate to advanced
512 pages
17h 55m
English
Wiley
Content preview from Theory of Computational Complexity, 2nd Edition

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 ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Theory of Computation

Theory of Computation

George Tourlakis

Publisher Resources

ISBN: 9781118594971Purchase book