П = НП проблем (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "П = НП проблем" in Serbian language version.
refsWebsite
Global rank
Serbian rank
1st place
1st place
low place
low place
8,402nd place
7,431st place
low place
low place
179th place
200th place
8,783rd place
low place
910th place
933rd place
230th place
217th place
11th place
23rd place
low place
low place
6,572nd place
2,709th 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.
mags.acm.org
- Rosenberger, Jack (мај 2012). „P vs. NP poll results”. Communications of the ACM. 55 (5): 10.
ams.org
- Babai, László (2018). „Group, graphs, algorithms: the graph isomorphism problem”. Proceedings of the International Congress of Mathematicians—Rio de Janeiro 2018. Vol. IV. Invited lectures. World Sci. Publ., Hackensack, NJ. стр. 3319—3336. MR 3966534.
- Gondzio, Jacek; Terlaky, Tamás (1996). „3 A computational view of interior point methods”. Ур.: J. E. Beasley. Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. 4. New York: Oxford University Press. стр. 103—144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.
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.
- Cook, Stephen (април 2000). „The P versus NP Problem” (PDF). Clay Mathematics Institute. Архивирано (PDF) из оригинала 2013-12-16. г. Приступљено 18. 10. 2006.
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.
- Aviezri Fraenkel and D. Lichtenstein (1981). „Computing a perfect strategy for n × n chess requires time exponential in n”. Journal of Combinatorial Theory. Series A. 31 (2): 199—214. doi:10.1016/0097-3165(81)90016-9.
- Valiant, Leslie G. (1979). „The complexity of enumeration and reliability problems”. SIAM Journal on Computing. 8 (3): 410—421. doi:10.1137/0208032.
- Ladner, R.E. (1975). „On the structure of polynomial time reducibility”. Journal of the ACM. 22: 151—171 See Corollary 1.1. S2CID 14352974. doi:10.1145/321864.321877
. - Arvind, Vikraman; Kurur, Piyush P. (2006). „Graph isomorphism is in SPP”. Information and Computation. 204 (5): 835—852. doi:10.1016/j.ic.2006.02.002.
- Schöning, Uwe (1988). „Graph isomorphism is in the low hierarchy”. Journal of Computer and System Sciences. 37 (3): 312—323. doi:10.1016/0022-0000(88)90010-4.
- Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed, Bruce (2012). „The disjoint paths problem in quadratic time”. Journal of Combinatorial Theory. Series B. 102 (2): 424—435. doi:10.1016/j.jctb.2011.07.004 .
- Johnson, David S. (1987). „The NP-completeness column: An ongoing guide (edition 19)”. Journal of Algorithms. 8 (2): 285—303. CiteSeerX 10.1.1.114.3864 . doi:10.1016/0196-6774(87)90043-5.
ed.ac.uk
maths.ed.ac.uk
- Gondzio, Jacek; Terlaky, Tamás (1996). „3 A computational view of interior point methods”. Ур.: J. E. Beasley. Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. 4. New York: Oxford University Press. стр. 103—144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.
fortnow.com
weblog.fortnow.com
- Lance Fortnow. Computational Complexity Blog: Complexity Class of the Week: Factoring. 13 September 2002.
mathnet.ru
- L. A. Levin (1973). „Универсальные задачи перебора” (на језику: руски). 9 (3) (Problems of Information Transmission изд.): 115—116.
mcmaster.ca
cas.mcmaster.ca
- Gondzio, Jacek; Terlaky, Tamás (1996). „3 A computational view of interior point methods”. Ур.: J. E. Beasley. Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. 4. New York: Oxford University Press. стр. 103—144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.
mit.edu
lcs.mit.edu
- Fischer, Michael J.; Rabin, Michael O. (1974). „Super-Exponential Complexity of Presburger Arithmetic”. Proceedings of the SIAM-AMS Symposium in Applied Mathematics. 7: 27—41. Архивирано из оригинала 15. 9. 2006. г. Приступљено 15. 10. 2017.
psu.edu
citeseerx.ist.psu.edu
- Johnson, David S. (1987). „The NP-completeness column: An ongoing guide (edition 19)”. Journal of Algorithms. 8 (2): 285—303. CiteSeerX 10.1.1.114.3864 . doi:10.1016/0196-6774(87)90043-5.
scottaaronson.com
- Scott Aaronson. „PHYS771 Lecture 6: P, NP, and Friends”. Приступљено 27. 8. 2007.
- Scott Aaronson (4. 9. 2006). „Reasons to believe”., point 9.
semanticscholar.org
api.semanticscholar.org
- Ladner, R.E. (1975). „On the structure of polynomial time reducibility”. Journal of the ACM. 22: 151—171 See Corollary 1.1. S2CID 14352974. doi:10.1145/321864.321877 .
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)
- Fischer, Michael J.; Rabin, Michael O. (1974). „Super-Exponential Complexity of Presburger Arithmetic”. Proceedings of the SIAM-AMS Symposium in Applied Mathematics. 7: 27—41. Архивирано из оригинала 15. 9. 2006. г. Приступљено 15. 10. 2017.
- Cook, Stephen (април 2000). „The P versus NP Problem” (PDF). Clay Mathematics Institute. Архивирано (PDF) из оригинала 2013-12-16. г. Приступљено 18. 10. 2006.
wikipedia.org
en.wikipedia.org
- Babai, László (2018). „Group, graphs, algorithms: the graph isomorphism problem”. Proceedings of the International Congress of Mathematicians—Rio de Janeiro 2018. Vol. IV. Invited lectures. World Sci. Publ., Hackensack, NJ. стр. 3319—3336. MR 3966534.
- Johnson, David S. (1987). „The NP-completeness column: An ongoing guide (edition 19)”. Journal of Algorithms. 8 (2): 285—303. CiteSeerX 10.1.1.114.3864 . doi:10.1016/0196-6774(87)90043-5.
- Gondzio, Jacek; Terlaky, Tamás (1996). „3 A computational view of interior point methods”. Ур.: J. E. Beasley. Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. 4. New York: Oxford University Press. стр. 103—144. MR 1438311. Postscript file at website of Gondzio and at McMaster University website of Terlaky.