Задача о клике: различия между версиями

157 байт добавлено ,  2 года назад
Спасено источников — 1, отмечено мёртвыми — 0. #IABot (v2.0beta)
(Спасено источников — 1, отмечено мёртвыми — 0. #IABot (v2.0beta))
 
== Литература ==
* {{cite conference | first = Stephen A. | last = Cook | authorlink = Кук, Стивен Артур | title = The Complexity of Theorem-Proving Procedures | year = 1971 | booktitle = Proceedings of the Third Annual ACM Symposium on Theory of Computing | location = Shaker Heights, Ohio | pages = 151-158 | url = http://www.cs.toronto.edu/~sacook/homepage/1971.pdf.gz | accessdate = 2007-06-11 | deadlink = yes | archiveurl = https://web.archive.org/web/20060503075606/http://www.cs.toronto.edu/~sacook/homepage/1971.pdf.gz | archivedate = 2006-05-03 }}
* {{Citation | first1 = Michael R. | last1 = Garey | author1-link = Michael R. Garey | first2 = David S. | last2 = Johnson | author2-link = David S. Johnson | year = 1979 | title = Computers and Intractability: A Guide to the Theory of NP-Completeness | publisher = W.H. Freeman | id = ISBN 0-7167-1045-5 }} A1.2: GT19, pg.194.