http://openproblemgarden.org/op/p_vs_np Comments for "P vs. NP" en http://openproblemgarden.org/op/p_vs_np <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/cook_stephen">Cook</a>; <a href="/category/levin_leonid_a">Levin</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/theoretical_computer_science">Theoretical Comp. Sci.</a> » <a href="/category/algorithms">Algorithms</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 P = NP? </div> </tr></td> </table> </td> </tr> </table> Cook, Stephen Levin, Leonid A. Complexity Class Computational Complexity Millenium Problems NP P polynomial algorithm Theoretical Computer Science Algorithms http://openproblemgarden.org/op/p_vs_np#comment Thu, 18 Oct 2007 18:11:46 +0200 zitterbewegung 661 at http://openproblemgarden.org