<?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="Computational complexity - Page 33 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Computational_complexity&amp;p=32">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_complexity&amp;p=34">3.Next</a>
</p>

<p>A standard method for demonstrating lower bounds for problem complexites consists of reducing a problem to another problem. More precisely, suppose that one may encode a problem  of size  into a subproblem of size  of a problem , and that the complexity of  is  Without loss of generality, one may suppose that the function  increases with  and has an <a href="page.php?w=inverse_function">inverse function</a> . Then the complexity of the problem  is  This is the method that is used to prove that, if <a href="page.php?w=P_%21%3D_NP">P != NP</a> (an</p><p>
<a accesskey="1" href="page.php?w=Computational_complexity&amp;p=32">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Computational_complexity&amp;p=34">3.Next</a>
</p>

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

</card>
</wml>
