Karp's 21 NP-complete problems (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Karp's 21 NP-complete problems" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

9,203^rd place

low place

207^th place

136^th place

1web.archive.org

1^st place

1^st place

doi.org

Karp 1972. Karp, Richard M. (1972). "Reducibility Among Combinatorial Problems" (PDF). In R. E. Miller; J. W. Thatcher; J.D. Bohlinger (eds.). Complexity of Computer Computations. New York: Plenum. pp. 85–103. doi:10.1007/978-1-4684-2001-2_9. ISBN 978-1-4684-2003-6.
Zuckerman 1996. Zuckerman, David (1996). "On Unapproximable Versions of NP-Complete Problems". SIAM Journal on Computing. 25 (6): 1293–1304. doi:10.1137/S0097539794266407. [1]

psu.edu

citeseer.ist.psu.edu

Zuckerman 1996. Zuckerman, David (1996). "On Unapproximable Versions of NP-Complete Problems". SIAM Journal on Computing. 25 (6): 1293–1304. doi:10.1137/S0097539794266407. [1]

uoa.gr

cgi.di.uoa.gr

Karp 1972. Karp, Richard M. (1972). "Reducibility Among Combinatorial Problems" (PDF). In R. E. Miller; J. W. Thatcher; J.D. Bohlinger (eds.). Complexity of Computer Computations. New York: Plenum. pp. 85–103. doi:10.1007/978-1-4684-2001-2_9. ISBN 978-1-4684-2003-6.

web.archive.org

Zuckerman 1996. Zuckerman, David (1996). "On Unapproximable Versions of NP-Complete Problems". SIAM Journal on Computing. 25 (6): 1293–1304. doi:10.1137/S0097539794266407. [1]