Telekommunikatsiya




Download 0,9 Mb.
bet5/5
Sana24.05.2024
Hajmi0,9 Mb.
#253014
1   2   3   4   5
Bog'liq
Bobur

" (PDF). Nazariy kompyuter fanlari bo'yicha Evropa assotsiatsiyasining Axborotnomasi. 38: 101–107.

  1. Sipser, Michael: Introduction to the Theory of Computation, Second Edition, International Edition, page 270. Thomson Course Technology, 2006. Definition

7.19 and Theorem 7.20.

  1. William I. Gasarch (Iyun 2002). " P=?NP poll" (PDF). SIGACT yangiliklari. 33 (2): 34–

47. CiteSeerX 10.1.1.172.1005. doi:10.1145/564585.564599.

  1. William I. Gasarch. "The Second P=?NP poll" (PDF). SIGACT yangiliklari. 74.

  1. "Guest Column: The Third P =? NP Poll1" (PDF). Olingan 25 may 2020.

  2. Scott Aaronson. "PHYS771 Lecture 6: P, NP, and Friends". Olingan 27 avgust 2007.

  3. "MSc course: Foundations of Computer Science". www.cs.ox.ac.uk. Olingan 25 may 2020.

  4. Colbourn, Charles J. (1984). "The complexity of completing partial Latin squares". Diskret amaliy matematika. 8 (1): 25–30. doi:10.1016 / 0166-218X (84) 90075-1.

  5. I. Holyer (1981). " NP-completeness of some edge-partition problems". SIAM J. Comput. 10 (4): 713–717. doi:10.1137/0210054.

https://fayllar.org/men-hissiyotlar-muammosi-men-muammo-bitta.html

    1. https://arxiv.uz

    2. https://uz.zahn-info-portal.de/wiki/P_versus_NP_problem

Download 0,9 Mb.
1   2   3   4   5




Download 0,9 Mb.