Теорија комплексности (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Теорија комплексности" in Serbian language version.

refsWebsite

Global rank Serbian rank

2web.archive.org

1^st place

1^st place

8,402^nd place

7,431^st place

2^nd place

4^th place

4^th place

8^th place

451^st place

838^th place

1,185^th place

1,193^rd place

1semanticscholar.org

11^th place

23^rd place

6^th place

5^th place

acm.org

portal.acm.org

Ladner, Richard E. (1975). „On the structure of polynomial time reducibility” (PDF). Journal of the ACM (JACM). 22 (1): 151—171. S2CID 14352974. doi:10.1145/321864.321877.

ams.org

Jaffe, Arthur M. „The Millennium Grand Challenge in Mathematics” (PDF). Notices of the AMS. 53 (6). Приступљено 2006-10-18.

archive.org

Du, Ding-Zhu; Ko, Ker-I (2000). Theory of Computational Complexity. John Wiley & Sons. ISBN 978-0-471-34506-0.

claymath.org

„P vs NP Problem | Clay Mathematics Institute”. www.claymath.org (на језику: енглески). Архивирано из оригинала 06. 07. 2018. г. Приступљено 14. 03. 2021.
Cook, Stephen (2000). „The P versus NP Problem” (PDF). Clay Mathematics Institute. Архивирано из оригинала (PDF) 12. 12. 2010. г. Приступљено 2006-10-18.

doi.org

Berger, Bonnie A.; Leighton, Terrance (1998). „Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete.”. Journal of Computational Biology. 5 (1): 27—40. PMID 9541869. doi:10.1089/cmb.1998.5.27.
Ladner, Richard E. (1975). „On the structure of polynomial time reducibility” (PDF). Journal of the ACM (JACM). 22 (1): 151—171. S2CID 14352974. doi:10.1145/321864.321877.

nih.gov

ncbi.nlm.nih.gov

Berger, Bonnie A.; Leighton, Terrance (1998). „Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete.”. Journal of Computational Biology. 5 (1): 27—40. PMID 9541869. doi:10.1089/cmb.1998.5.27.

semanticscholar.org

api.semanticscholar.org

Ladner, Richard E. (1975). „On the structure of polynomial time reducibility” (PDF). Journal of the ACM (JACM). 22 (1): 151—171. S2CID 14352974. doi:10.1145/321864.321877.

web.archive.org

„P vs NP Problem | Clay Mathematics Institute”. www.claymath.org (на језику: енглески). Архивирано из оригинала 06. 07. 2018. г. Приступљено 14. 03. 2021.
Cook, Stephen (2000). „The P versus NP Problem” (PDF). Clay Mathematics Institute. Архивирано из оригинала (PDF) 12. 12. 2010. г. Приступљено 2006-10-18.