<?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 8 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=computational_complexity&amp;p=7">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_complexity&amp;p=9">3.Next</a>
</p>
<p>it equals the time complexity up to a constant factor. On <a href="page.php?w=computer">computer</a>s, the number of operations on <a href="page.php?w=machine_word">machine word</a>s that are needed is also proportional to the bit complexity. So, the time complexity and the bit complexity are equivalent  for realistic models of computation.</p>

<p><big>Space</big></p>
<p>Another important resource is the size of <a href="page.php?w=computer_memory">computer memory</a> that is needed for running algorithms.</p>

<p><big>Circuit</big></p>
<p><big>Communication</big></p>
<p>For</p><p>
<a accesskey="1" href="page.php?w=computational_complexity&amp;p=7">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_complexity&amp;p=9">3.Next</a>
</p>

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

</card>
</wml>
