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

9,203^rd place

7,018^th place

4mhz.de (Global: low place; Simple English: 7,453^rd place)

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

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

Richard M. Karp (1972). "Reducibility Among Combinatorial Problems" (PDF). In R. E. Miller; J. W. Thatcher (eds.). Complexity of Computer Computations. New York: Plenum. pp. 85–103.{{cite book}}: CS1 maint: publisher location (link)