НП (класа комплексности) — разлика између измена
Садржај обрисан Садржај додат
м razne izmene |
Add 1 book for Википедија:Проверљивост (20210201)) #IABot (v2.0.8) (GreenC bot |
||
Ред 43:
* -{ Complexity Zoo: [https://web.archive.org/web/20061128071923/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. {{page|year=2001|isbn=978-0-262-03293-3|pages=}}. Section 34.2: Polynomial-time verification, pp. 979-983.}-
* -{ {{cite book| last = Sipser | first = Michael |year=1997| title = Introduction to the Theory of Computation | url = https://archive.org/details/introductiontoth00sips | publisher = PWS Publishing |isbn=978-0-534-94728-6}} 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.}-
| |||