<?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="Space complexity - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Space_complexity&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Space_complexity&amp;p=5">3.Next</a>
</p>
<p>states that, for all <a href="page.php?w=space-constructible_function">space-constructible function</a>s  there exists a problem that can be solved by a machine with  memory space, but cannot be solved by a machine with asymptotically less than  space.</p>

<p>The following containments between complexity classes hold.</p>

<p>Furthermore, <a href="page.php?w=Savitch%27s_theorem">Savitch's theorem</a> gives the reverse containment that if </p>

<p>As a direct corollary,  This result is surprising because it suggests that non-determinism can reduce</p><p>
<a accesskey="1" href="page.php?w=Space_complexity&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Space_complexity&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
