Skip to main content

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

Bookreader Item Preview

texts

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

by
Garey, Michael R

Publication date
Topics
Algorithms, Computational complexity, Computer programming
Publisher
San Francisco : W. H. Freeman
Collection
trent_university; internetarchivebooks; printdisabled
Contributor
Internet Archive
Language
English
Item Size
966.7M
x, 338 p. : 24 cm. --

Includes indexes

Bibliography: p. [291]-325

Notes

key stoning

Access-restricted-item
true
Addeddate
2019-06-08 13:18:41
Associated-names
Johnson, David S., 1945-
Bookplateleaf
0004
Boxid
IA1249213
Camera
Sony Alpha-A6300 (Control)
Collection_set
trent
External-identifier
urn:oclc:record:1148590147[WorldCat (this item)]
urn:lcp:computersintract0000gare:lcpdf:082be0e6-af44-44a5-a75a-534d6dd62e33
urn:lcp:computersintract0000gare:epub:9f1abc0e-8fdf-45f5-af3d-5f54f4930373
Foldoutcount
0
Grant_report
Arcadia #4117
Identifier
computersintract0000gare
Identifier-ark
ark:/13960/t2j754z6q
Full catalog record
MARCXML


comment
Reviews (1)

3,034 Views

28 Favorites

1 Review

Purchase options

Better World Books

DOWNLOAD OPTIONS

No suitable files to display here.

IN COLLECTIONS

Trent University Library Donation Internet Archive Books

Uploaded by station12.cebu on

SIMILAR ITEMS (based on metadata)

Terms of Service (last updated 12/31/2014)