Computers and Intractability A guide to the theory of NP-completeness

By: Garey, Michael R | Johnson, David SMaterial type: TextTextSeries: Series of Books in the Mathematical SciencesPublication details: New York ; Freeman ; 1979Description: 338pISBN: 0 7167 1045 5Subject(s): Electronic digital computers - Programming Algorithms Computational Complexity
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified Status Date due Barcode
IMSc Library
IMSc Library
681.3 GAR (Browse shelf (Opens below)) Available 29628

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha