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.

Last modified: 10:59:48, 1 June 2025 (UTC)

Ref.Un. Ref.Website

Global rank Simple English rank

226^th place

156^th place

2^nd place

308^th place

166^th place

low place

8,455^th place

low place

4mhz.de (Global: low place; Simple English: low 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)