Criar um Site Grátis Fantástico


Total de visitas: 18071
Computer and intractability: a guide to the

Computer and intractability: a guide to the theory of NP-completeness. David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness


Computer.and.intractability.a.guide.to.the.theory.of.NP.completeness.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb


Download Computer and intractability: a guide to the theory of NP-completeness



Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd




Computers and Intractability; A Guide to the Theory of NP-Completeness . Ɲ自维基百科的NPC问题收集,大多数问题来自:Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. Great Books: Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). For details, see for example M. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. Solving a system of non-linear modular arithmetic equations is NP-complete.

More eBooks:
Table of integrals, series, and products pdf
Master Data Management (The MK OMG Press) pdf download
Nanomaterials, Nanotechnologies and Design: An Introduction for Engineers and Architects epub