Mavzu: Graf daraxtini qurish va murakkablik darajasini baholash usullari

11) "Guest Column: The Third P =? NP Poll1" (PDF). Olingan 25 may 2020.
12) Scott Aaronson. "PHYS771 Lecture 6: P, NP, and Friends". Olingan 27 avgust 2007.
13) "MSc course: Foundations of Computer Science". www.cs.ox.ac.uk. Olingan 25 may 2020.
14) 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.
15) 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