Editing P versus NP problem (section)

==Sources==
*{{cite web
| url = https://www.scientificamerican.com/article/the-top-unsolved-questions-in-mathematics-remain-mostly-mysterious/
| title = The Top Unsolved Questions in Mathematics Remain Mostly Mysterious Just one of the seven Millennium Prize Problems named 21 years ago has been solved
|author =  Rachel Crowell 
|date = 28 May 2021
| work = www.[[scientificamerican.com]]
|archive-url=
|archive-date=
| access-date = 21 June 2021
|quote = This problem concerns the issue of whether questions that are easy to verify (a class of queries called NP) also have solutions that are easy to find (a class called P).}}
* {{cite encyclopedia
|entry-url = https://www.britannica.com/science/P-versus-NP-problem
| last1 = Hosch 
| first1 = William L 
|entry= P versus NP problem mathematics
| date = 11 August 2009 
| encyclopedia =[[Encyclopædia Britannica]]
| access-date = 20 June 2021}}
*{{cite web
| url = https://www.claymath.org/millennium-problems/p-vs-np-problem
| title = P vs NP Problem
| work =www.claymath.org (Cook, Levin)
|archive-url=
|archive-date=
| access-date = 20 June 2021
|quote = "Suppose that you are organizing housing accommodations for a group of four hundred university students. Space is limited and only one hundred of the students will receive places in the dormitory. To complicate matters, the Dean has provided you with a list of pairs of incompatible students, and requested that no pair from this list appear in your final choice. This is an example of what computer scientists call an NP-problem..."}}