Computer and intractability: a guide to the theory of NP-completeness pdf free
Par murray edith le dimanche, août 14 2016, 01:05 - Lien permanent
Computer and intractability: a guide to the theory of NP-completeness by David S. Johnson, Michael R. Garey
Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Publisher: W.H.Freeman & Co Ltd
ISBN: 0716710447, 9780716710448
Format: djvu
Page: 175
Computers and Intractability: A Guide to the. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). ACM Queue, 5:16–21, November 2007. Ņ�中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. For details, see for example M. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Garey, Michael R., and David S. Solving a system of non-linear modular arithmetic equations is NP-complete.