Lý thuyết độ phức tạp tính toán (Vietnamese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Lý thuyết độ phức tạp tính toán" in Vietnamese language version.

refsWebsite
Global rank Vietnamese rank
2nd place
2nd place
741st place
587th place
1st place
1st place
4th place
7th place
8,402nd place
low place
451st place
287th place
1,185th place
930th place
580th place
543rd place

acm.org (Global: 1,185th place; Vietnamese: 930th place)

delivery.acm.org

ams.org (Global: 451st place; Vietnamese: 287th place)

berkeley.edu (Global: 580th place; Vietnamese: 543rd place)

cs.berkeley.edu

claymath.org (Global: 8,402nd place; Vietnamese: low place)

doi.org (Global: 2nd place; Vietnamese: 2nd place)

  • Berger, Bonnie A.; Leighton, T (1998), "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete", Journal of Computational Biology, 5 (1): 27–40, doi:10.1089/cmb.1998.5.27, PMID 9541869. {{Chú thích}}: Đã định rõ hơn một tham số trong |number=|issue= (trợ giúp)
  • Ladner, Richard E. (1975), "On the structure of polynomial time reducibility" (PDF), Journal of the ACM (JACM), 22 (1): 151–171, doi:10.1145/321864.321877.
  • Yamada, H. (1962). "Real-Time Computation and Recursive Functions Not Real-Time Computable". IEEE Transactions on Electronic Computers. Quyển EC-11 số 6. tr. 753–760. doi:10.1109/TEC.1962.5219459.

nih.gov (Global: 4th place; Vietnamese: 7th place)

pubmed.ncbi.nlm.nih.gov

  • Berger, Bonnie A.; Leighton, T (1998), "Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete", Journal of Computational Biology, 5 (1): 27–40, doi:10.1089/cmb.1998.5.27, PMID 9541869. {{Chú thích}}: Đã định rõ hơn một tham số trong |number=|issue= (trợ giúp)

princeton.edu (Global: 741st place; Vietnamese: 587th place)

cs.princeton.edu

web.archive.org (Global: 1st place; Vietnamese: 1st place)