शोर का अल्गोरिद्म (Hindi Wikipedia)

Analysis of information sources in references of the Wikipedia article "शोर का अल्गोरिद्म" in Hindi language version.

refsWebsite
Global rank Hindi rank
6th place
6th place

archive.org

  • Papadimitriou, Christos H. (1994). Computational complexity (अंग्रेज़ी में) (Reprinted with corr., [Nachdr.] संस्करण). Reading, Mass. [u.a.]: Addison-Wesley. पपृ॰ 6. आई॰ऍस॰बी॰ऍन॰ 0-201-53082-1. In the course of this book we shall regard such polynomial rates of growth as acceptable time requirements, as a sign that the problem has been solved satisfactorily.
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). "Polynomial time". Introduction to algorithms (अंग्रेज़ी में) (3rd ed. संस्करण). Cambridge, Massachusetts: MIT Press. पपृ॰ 1053-1054. आई॰ऍस॰बी॰ऍन॰ 978-0-262-03384-8.सीएस1 रखरखाव: फालतू पाठ (link)