НП (класа комплексности) — разлика између измена

* -{ Complexity Zoo: [http://qwiki.caltech.edu/wiki/Complexity_Zoo#np NP]}-

* -{ Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. ''Introduction to Algorithms'', Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 34.2: Polynomial-time verification, pp.979–-983.}-

* -{ {{cite book|author = Michael Sipser | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | id = ISBN 0-534-94728-X}} Sections 7.3–-7.5 (The Class NP, NP-completeness, Additional NP-complete Problems), pp.241–-271.}-

* -{David Harel, Yishai Feldman. Algorithmics: The Spirit of Computing, Addison-Wesley, Reading, MA, 3rd edition, 2004.}-