Wikiplacemarks.com  
 



Find us on Google+

P versus NP problem

View on map:43.661667°N 79.395000°W

Comments

Stephen Cook was the first to introduce the concept and he worked at the University of Toronto which is located here.

Description


P versus NP problem

The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was introduced in 1971 by Stephen Cook 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.[3] It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US$ 1,000,000 prize for the first correct solution.

References

All text is available under the terms of the Creative Commons Attribution-ShareAlike License
Average user rating: Not rated

Click on a star to rate
 

Do you have a form that you would like to turn into an application?

Please share your ideas with us.

Contact us...