Editing P versus NP problem (section)

==External links==
{{Sister project links| wikt=no | commons=no | b=no | n=no | q=P versus NP problem | s=no | v=no | voy=no | species=no | d=no}}

* {{cite web | last1= Fortnow | first1 = L. | last2 = Gasarch | first2 = W. | title = Computational complexity | url =  http://weblog.fortnow.com }}
* [https://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-146.pdf Aviad Rubinstein's ''Hardness of Approximation Between P and NP''], winner of the [[Association for Computing Machinery|ACM]]'s [https://awards.acm.org/about/2017-doctoral-dissertation 2017 Doctoral Dissertation Award].
* {{cite web |title=P vs. NP and the Computational Complexity Zoo |date=26 August 2014 |url=https://www.youtube.com/watch?v=YX40hbAHx3s | archive-url=https://ghostarchive.org/varchive/youtube/20211124/YX40hbAHx3s| archive-date=2021-11-24 | url-status=live|via=[[YouTube]] }}{{cbignore}}

{{ComplexityClasses}}

{{DEFAULTSORT:P Versus Np Problem}}
[[Category:1956 in computing]]
[[Category:Computer-related introductions in 1956]]
[[Category:Conjectures]]
[[Category:Mathematical optimization]]
[[Category:Millennium Prize Problems]]
[[Category:Structural complexity theory]]
[[Category:Unsolved problems in computer science]]
[[Category:Unsolved problems in mathematics]]