<?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="Conjecture - Page 33 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Conjecture&amp;p=32">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Conjecture&amp;p=34">3.Next</a>
</p>
<p>in quadratic or linear time. The precise statement of the P=NP problem was introduced in 1971 by <a href="page.php?w=Stephen_Cook">Stephen Cook</a> in his seminal paper "The complexity of theorem proving procedures" and is considered by many to be the most important open problem in the field. It is one of the seven <a href="page.php?w=Millennium_Prize_Problems">Millennium Prize Problems</a> selected by the <a href="page.php?w=Clay_Mathematics_Institute">Clay Mathematics Institute</a> to carry a US$1,000,000 prize for the first correct solution.</p><p>
<a accesskey="1" href="page.php?w=Conjecture&amp;p=32">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Conjecture&amp;p=34">3.Next</a>
</p>

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

</card>
</wml>
