Masalah P versus NP (Indonesian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Masalah P versus NP" in Indonesian language version.

refsWebsite

Global rank Indonesian rank

1,185^th place

2,434^th place

230^th place

175^th place

2^nd place

4^th place

acm.org

portal.acm.org

R. E. Ladner "On the structure of polynomial time reducibility," Journal of the ACM 22, pp. 151–171, 1975. Corollary 1.1. ACM site.
Cook, Stephen (1971). "The complexity of theorem proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. hlm. 151–158.

doi.org

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186.

uchicago.edu

cs.uchicago.edu

Fortnow, Lance (2009). "The status of the P versus NP problem" (PDF). Communications of the ACM. 52 (9): 78–86. doi:10.1145/1562164.1562186.