Computers and intractability - Info and Reading Options
a guide to the theory of NP-completeness
By Michael R. Garey and David S. Johnson
"Computers and intractability" was published by W.H. Freeman in 1983 - New York, it has 340 pages and the language of the book is English.
“Computers and intractability” Metadata:
- Title: Computers and intractability
- Authors: Michael R. GareyDavid S. Johnson
- Language: English
- Number of Pages: 340
- Publisher: W.H. Freeman
- Publish Date: 1983
- Publish Location: New York
“Computers and intractability” Subjects and Themes:
- Subjects: ➤ Algorithms - Computational complexity - Computer algorithms - Computer programming - Computer science, mathematics - Qa76.6 .g35 - 519.4
Edition Specifications:
- Pagination: x, 340 p. :
Edition Identifiers:
- The Open Library ID: OL18435202M - OL6801337W
- Online Computer Library Center (OCLC) ID: 4195125 - 11272890
- Library of Congress Control Number (LCCN): 78012361
- ISBN-10: 0716710455
- All ISBNs: 0716710455
AI-generated Review of “Computers and intractability”:
Read “Computers and intractability”:
Read “Computers and intractability” by choosing from the options below.
Search for “Computers and intractability” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Computers and intractability" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: restricted
- Check if available: The Open Library & The Internet Archive
Find “Computers and intractability” in Libraries Near You:
Read or borrow “Computers and intractability” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Computers and intractability” at a library near you.
Buy “Computers and intractability” online:
Shop for “Computers and intractability” on popular online marketplaces.
- Ebay: New and used books.