Foto 1 di 1
Foto di catalogo
Foto 1 di 1
Foto di catalogo
Computers and Intractability : A Guide to the Theory of NP-Completeness by D. Johnson and M. Garey (1979, Trade Paperback)
B
Brenham Book Company (1323)
94,6% di feedback positivi
Prezzo:
US $103,31
CircaEUR 89,55
+ $28,07 di spese di spedizione
Restituzioni:
Restituzioni entro 30 giorni. Le spese di spedizione del reso sono a carico dell'acquirente.. La regola varia a seconda del servizio di spedizione.
Condizione:
A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity.
- Compralo SubitoComputers and Intractability: A Guide to the Theory of NP-Comple
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Informazioni su questo prodotto
Product Identifiers
PublisherFreeman & Company, W&H
ISBN-100716710455
ISBN-139780716710455
eBay Product ID (ePID)864402
Product Key Features
Number of Pages340 Pages
LanguageEnglish
Publication NameComputers and Intractability : a Guide to the Theory of Np-Completeness
Publication Year1979
SubjectProgramming / General, General, Discrete Mathematics
TypeTextbook
AuthorD. Johnson, M. Garey
Subject AreaMathematics, Computers
FormatTrade Paperback
Dimensions
Item Height0.7 in
Item Weight17.6 Oz
Item Length9.2 in
Item Width6.1 in
Additional Product Features
Intended AudienceCollege Audience
LCCN78-012361
Dewey Edition21
IllustratedYes
Dewey Decimal519.4/0285
LC Classification NumberQA297
Tutte le inserzioni per questo prodotto
Scrivi una recensione per primo
