Wikipedysta:Platyna2502/brudnopis: Różnice pomiędzy wersjami

* [[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–983979–983.

* {{citecytuj bookksiążkę|authorautor = [[Michael Sipser]] | yearrok = 1997 | titletytuł = Introduction to the Theory of Computation | publisherwydawca = PWS Publishing | isbn = 0-534-94728-X}} Sections 7.3–73–7.5 (The Class NP, NP-completeness, Additional NP-complete Problems), pp. 241–271241–271.