Airhog
08-09-2010, 09:42 AM
pnp12pt (http://www.scribd.com/doc/35539144/pnp12pt)
for those of you that have no clue what P and NP are
P versus NP problem - Wikipedia, the free encyclopedia (http://en.wikipedia.org/wiki/P_versus_NP_problem)
For those of you too lazy to click on the links
The relationship between the complexity classes (http://en.wikipedia.org/wiki/Complexity_class) P (http://en.wikipedia.org/wiki/P_%28complexity%29) (Polynomial time) and NP (http://en.wikipedia.org/wiki/NP_%28complexity%29) (Nondeterministic Polynomial time) is an unsolved problem in theoretical computer science (http://en.wikipedia.org/wiki/Theoretical_computer_science), and is considered by many theoretical computer scientists (http://en.wikipedia.org/wiki/Theoretical_computer_science) to be the most important problem in the field.<sup id="cite_ref-1" class="reference">[2] (http://en.wikipedia.org/wiki/P_versus_NP_problem#cite_note-1)</sup> The Clay Mathematics Institute (http://en.wikipedia.org/wiki/Clay_Mathematics_Institute), which is dedicated to increasing and disseminating mathematical knowledge, has included it in its list of Millennium Prize Problems (http://en.wikipedia.org/wiki/Millennium_Prize_Problems); anyone who provides a satisfactory solution to the problem may be entitled to a USD $1,000,000 prize.<sup id="cite_ref-CMI_Millennium_Prize_Problems_2-0" class="reference">[3] (http://en.wikipedia.org/wiki/P_versus_NP_problem#cite_note-CMI_Millennium_Prize_Problems-2)</sup><sup id="cite_ref-Official_Problem_Description_3-0" class="reference">[4] (http://en.wikipedia.org/wiki/P_versus_NP_problem#cite_note-Official_Problem_Description-3)</sup>
for those of you that have no clue what P and NP are
P versus NP problem - Wikipedia, the free encyclopedia (http://en.wikipedia.org/wiki/P_versus_NP_problem)
For those of you too lazy to click on the links
The relationship between the complexity classes (http://en.wikipedia.org/wiki/Complexity_class) P (http://en.wikipedia.org/wiki/P_%28complexity%29) (Polynomial time) and NP (http://en.wikipedia.org/wiki/NP_%28complexity%29) (Nondeterministic Polynomial time) is an unsolved problem in theoretical computer science (http://en.wikipedia.org/wiki/Theoretical_computer_science), and is considered by many theoretical computer scientists (http://en.wikipedia.org/wiki/Theoretical_computer_science) to be the most important problem in the field.<sup id="cite_ref-1" class="reference">[2] (http://en.wikipedia.org/wiki/P_versus_NP_problem#cite_note-1)</sup> The Clay Mathematics Institute (http://en.wikipedia.org/wiki/Clay_Mathematics_Institute), which is dedicated to increasing and disseminating mathematical knowledge, has included it in its list of Millennium Prize Problems (http://en.wikipedia.org/wiki/Millennium_Prize_Problems); anyone who provides a satisfactory solution to the problem may be entitled to a USD $1,000,000 prize.<sup id="cite_ref-CMI_Millennium_Prize_Problems_2-0" class="reference">[3] (http://en.wikipedia.org/wiki/P_versus_NP_problem#cite_note-CMI_Millennium_Prize_Problems-2)</sup><sup id="cite_ref-Official_Problem_Description_3-0" class="reference">[4] (http://en.wikipedia.org/wiki/P_versus_NP_problem#cite_note-Official_Problem_Description-3)</sup>