<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="BPP (complexity) - Page 21 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=BPP_(complexity)&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=BPP_%28complexity%29&amp;p=22">3.Next</a>
</p>
<p>the relativized  answers.  Also, we can ensure that for the relativized , linear time suffices, even for function problems (if given a function oracle and linear output size) and with exponentially small (with linear exponent) error probability.  Also, this construction is effective in that given an arbitrary oracle A we can arrange the oracle B to have  and .  Also, for a  oracle (and hence ), one would fix the answers in the relativized E computation to a special nonanswer, thus ensuring that no fake answers are given.</p>

<p><big> Derandomization </big></p><p>
<a accesskey="1" href="page.php?w=BPP_(complexity)&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=BPP_%28complexity%29&amp;p=22">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
