Computer and intractability: a guide to the theory of NP-completeness book
Par stallings amanda le mardi, décembre 6 2016, 01:18 - 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 Theory of NP-Completeness [M]. Computers and Intractability: A Guide to the Theory of NP-completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. For details, see for example M. Solving a system of non-linear modular arithmetic equations is NP-complete. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. Ņ�中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. Computer and intractability: a guide to the theory of NP-completeness book download David S.