NP (complexity) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "NP (complexity)" in English language version.

Last modified: 02:40:18, 13 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

33doi.org

2^nd place

32archive.org

6^th place

22semanticscholar.org

15^th place

8^th place

21ias.edu

7,148^th place

5,150^th place

11books.google.com

3^rd place

11umd.edu

1,356^th place

1,172^nd place

11web.archive.org

1^st place

11uwaterloo.ca

3,649^th place

2,434^th place

11fortnow.com

low place

11uoa.gr

8,455^th place

low place

11scottaaronson.com

low place

11ams.org

434^th place

249^th place

11worldcat.org

4^th place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 978-0-7167-1045-5. MR 0519066. OCLC 247570676.

archive.org (Global: 6^th place; English: 6^th place)

Kleinberg, Jon; Tardos, Éva (2006). Algorithm Design (2nd ed.). Addison-Wesley. p. 464. ISBN 0-321-37291-3.
Kleinberg, Jon; Tardos, Éva (2006). Algorithm Design (2nd ed.). Pearson/Addison-Wesley. p. 496. ISBN 0-321-37291-3.

books.google.com (Global: 3^rd place; English: 3^rd place)

Alsuwaiyel, M. H.: Algorithms: Design Techniques and Analysis, p. 283.

doi.org (Global: 2^nd place; English: 2^nd place)

Ladner, R. E. (1975). "On the structure of polynomial time reducibility". J. ACM. 22: 151–171. doi:10.1145/321864.321877. S2CID 14352974. Corollary 1.1.
Gasarch, William (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. doi:10.1145/1052796.1052804. S2CID 18759797. Retrieved 2008-12-29.
Karp, Richard (1972). "Reducibility among Combinatorial Problems" (PDF). Complexity of Computer Computations. pp. 85–103. doi:10.1007/978-1-4684-2001-2_9. ISBN 978-1-4684-2003-6.

fortnow.com (Global: low place; English: low place)

weblog.fortnow.com

Lance Fortnow, Pulling Out The Quantumness, December 20, 2005

ias.edu (Global: 7,148^th place; English: 5,150^th place)

math.ias.edu

Wigderson, Avi. "P, NP and mathematics – a computational complexity perspective" (PDF). Retrieved 13 Apr 2021.

scottaaronson.com (Global: low place; English: low place)

Aaronson, Scott. "P=? NP" (PDF). Retrieved 13 Apr 2021.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Ladner, R. E. (1975). "On the structure of polynomial time reducibility". J. ACM. 22: 151–171. doi:10.1145/321864.321877. S2CID 14352974. Corollary 1.1.
Gasarch, William (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. doi:10.1145/1052796.1052804. S2CID 18759797. Retrieved 2008-12-29.

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

cs.umd.edu

Gasarch, William (June 2002). "The P=?NP poll" (PDF). SIGACT News. 33 (2): 34–47. doi:10.1145/1052796.1052804. S2CID 18759797. Retrieved 2008-12-29.

uoa.gr (Global: 8,455^th place; English: low place)

cgi.di.uoa.gr

Karp, Richard (1972). "Reducibility among Combinatorial Problems" (PDF). Complexity of Computer Computations. pp. 85–103. doi:10.1007/978-1-4684-2001-2_9. ISBN 978-1-4684-2003-6.

uwaterloo.ca (Global: 3,649^th place; English: 2,434^th place)

complexityzoo.uwaterloo.ca

"Complexity Zoo:E". Complexity Zoo. Archived from the original on 2020-11-11. Retrieved 23 March 2018.

web.archive.org (Global: 1^st place; English: 1^st place)

"Complexity Zoo:E". Complexity Zoo. Archived from the original on 2020-11-11. Retrieved 23 March 2018.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 978-0-7167-1045-5. MR 0519066. OCLC 247570676.

NP (complexity) (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

books.google.com (Global: 3rd place; English: 3rd place)

doi.org (Global: 2nd place; English: 2nd place)

fortnow.com (Global: low place; English: low place)

weblog.fortnow.com

ias.edu (Global: 7,148th place; English: 5,150th place)

math.ias.edu

scottaaronson.com (Global: low place; English: low place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

umd.edu (Global: 1,356th place; English: 1,172nd place)

cs.umd.edu

uoa.gr (Global: 8,455th place; English: low place)

cgi.di.uoa.gr

uwaterloo.ca (Global: 3,649th place; English: 2,434th place)

complexityzoo.uwaterloo.ca

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

ams.org (Global: 434^th place; English: 249^th place)

archive.org (Global: 6^th place; English: 6^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

ias.edu (Global: 7,148^th place; English: 5,150^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

uoa.gr (Global: 8,455^th place; English: low place)

uwaterloo.ca (Global: 3,649^th place; English: 2,434^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)