NP (complexity) (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

6^th place

6^th place

1books.google.com

3^rd place

3^rd place

1,747^th place

1,277^th place

1web.archive.org

1^st place

1^st place

3,153^rd place

2,332^nd place

low place

low place

7,948^th place

5,350^th place

9,203^rd place

low place

1scottaaronson.com

low place

low place

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.
William Gasarch (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,948^th place; English: 5,350^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: 11^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.
William Gasarch (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,747^th place; English: 1,277^th place)

cs.umd.edu

William Gasarch (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: 9,203^rd 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,153^rd place; English: 2,332^nd 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.