П = НП проблем (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "П = НП проблем" in Serbian language version.

refsWebsite

Global rank Serbian rank

3umd.edu

1,747^th place

2,369^th place

2acm.org

1,185^th place

1,193^rd place

2web.archive.org

1^st place

2doi.org

2^nd place

4^th place

1claymath.org

8,402^nd place

7,431^st place

1stanford.edu

179^th place

200^th place

1mathnet.ru

8,783^rd place

low place

1archive-it.org

910^th place

933^rd place

1uchicago.edu

230^th place

217^th place

1scottaaronson.com

low place

acm.org

portal.acm.org

R. E. Ladner "On the structure of polynomial time reducibility," J.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. стр. 151—158.

archive-it.org

wayback.archive-it.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. Архивирано из оригинала (PDF) 24. 02. 2011. г. Приступљено 06. 11. 2019.

claymath.org

„Millennium Prize Problems”. 24. 5. 2000. Архивирано из оригинала 08. 01. 2008. г. Приступљено 12. 1. 2008.

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. Архивирано из оригинала (PDF) 24. 02. 2011. г. Приступљено 06. 11. 2019.
Gasarch, William I. (2002). „The P=?NP poll.” (PDF). SIGACT News. 33 (2): 34—47. doi:10.1145/1052796.1052804.

mathnet.ru

L. A. Levin (1973). „Универсальные задачи перебора” (на језику: руски). 9 (3) (Problems of Information Transmission изд.): 115—116.

scottaaronson.com

Scott Aaronson. „PHYS771 Lecture 6: P, NP, and Friends”. Приступљено 27. 8. 2007.

stanford.edu

qwiki.stanford.edu

Scott Aaronson. Complexity Zoo: FP. "FP = FNP if and only if P = NP". http://qwiki.stanford.edu/wiki/Complexity_Zoo#fp}- Архивирано на сајту Wayback Machine (26. јул 2010)

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. Архивирано из оригинала (PDF) 24. 02. 2011. г. Приступљено 06. 11. 2019.

umd.edu

cs.umd.edu

Gasarch, William I. (2002). „The P=?NP poll.” (PDF). SIGACT News. 33 (2): 34—47. doi:10.1145/1052796.1052804.
William I. Gasarch. „The Second P=?NP poll” (PDF). SIGACT News. 74.
„Guest Column: The Third P =? NP Poll1” (PDF).

web.archive.org

„Millennium Prize Problems”. 24. 5. 2000. Архивирано из оригинала 08. 01. 2008. г. Приступљено 12. 1. 2008.
Scott Aaronson. Complexity Zoo: FP. "FP = FNP if and only if P = NP". http://qwiki.stanford.edu/wiki/Complexity_Zoo#fp}- Архивирано на сајту Wayback Machine (26. јул 2010)