<?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="Complexity - Page 16 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Complexity&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Complexity&amp;p=17">3.Next</a>
</p>
<p>(usually measured in <a href="page.php?w=Bit">bits</a>), using the most efficient <a href="page.php?w=algorithm">algorithm</a>, and the space complexity of a problem equal to the volume of the <a href="page.php?w=computer_storage">memory</a> used by the algorithm (e.g., cells of the tape) that it takes to solve an instance of the problem as a function of the size of the input (usually measured in bits), using the most efficient algorithm. This allows classification of computational problems by <a href="page.php?w=complexity_class">complexity class</a></p><p>
<a accesskey="1" href="page.php?w=Complexity&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Complexity&amp;p=17">3.Next</a>
</p>

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

</card>
</wml>
