Sign In

Login

Password

Forgot Password ? Sign Up

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
3doi.org
2nd place
2nd place
2semanticscholar.org
11th place
8th place
2archive.org
6th place
6th place
1books.google.com
3rd place
3rd place
1umd.edu
1,747th place
1,277th place
1web.archive.org
1st place
1st place
1uwaterloo.ca
3,153rd place
2,332nd place
1fortnow.com
low place
low place
1ias.edu
7,948th place
5,350th place
1uoa.gr
9,203rd place
low place
1scottaaronson.com
low place
low place

archive.org

books.google.com

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

doi.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.
  • 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

weblog.fortnow.com

ias.edu

math.ias.edu

scottaaronson.com

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

semanticscholar.org

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

cs.umd.edu

uoa.gr

cgi.di.uoa.gr

uwaterloo.ca

complexityzoo.uwaterloo.ca

web.archive.org