Karps 21 NP-volledige problemen (Dutch Wikipedia)

Analysis of information sources in references of the Wikipedia article "Karps 21 NP-volledige problemen" in Dutch language version.

refsWebsite

Global rank Dutch rank

9,203^rd place

low place

179^th place

319^th place

1web.archive.org

1^st place

1^st place

stanford.edu

cs.stanford.edu

Stephen A. Cook. "The Complexity of Theorem-Proving Procedures." In: STOC '71 Proceedings of the third annual ACM symposium on Theory of computing. ACM, 1971, blz. 151-158. Gearchiveerd op 2 maart 2014.

uoa.gr

cgi.di.uoa.gr

Richard M. Karp. "Reducibility Among Combinatorial Problems". In: Raymond E. Miller, James W. Thatcher (Eds.): Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York. Plenum Press, New York 1972 (blz. 85-103)

web.archive.org

Stephen A. Cook. "The Complexity of Theorem-Proving Procedures." In: STOC '71 Proceedings of the third annual ACM symposium on Theory of computing. ACM, 1971, blz. 151-158. Gearchiveerd op 2 maart 2014.