P versus NP problem (Simple English Wikipedia)

Analysis of information sources in references of the Wikipedia article "P versus NP problem" in Simple English language version.

refsWebsite

Global rank Simple English rank

230^th place

202^nd place

2^nd place

3^rd place

332^nd place

231^st place

low place

7,453^rd place

4mhz.de

Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158.

cornell.edu

ecommons.library.cornell.edu

Juris Hartmanis 1989, Gödel, von Neumann, and the P = NP problem, Bulletin of the European Association for Theoretical Computer Science, vol. 38, pp. 101–107

doi.org

dx.doi.org

Lance Fortnow, The status of the P versus NP problem, Communications of the ACM 52 (2009), no. 9, pp. 78–86. doi:10.1145/1562164.1562186

uchicago.edu

cs.uchicago.edu

Lance Fortnow, The status of the P versus NP problem, Communications of the ACM 52 (2009), no. 9, pp. 78–86. doi:10.1145/1562164.1562186