| Shelfclass_id | 3.D.4 |
| Sortkey | GAREY, MICHAEL R |
| Authors | Michael R. Garey, David S. Johnson |
| Title | Computers and Intractability: A Guide to the Theory of NP-Completeness |
| Publisher | Freeman |
| Year | cop. 1979 |
| Languages | eng |
| Isbn | 0716710447, 0716710455 |
| Series | A series of books in the mathematical sciences |
| Issn | 99-0165871 |
| Description | (inb.) (hft.) x, 338 s. ill |
| Record date | 20060630 |
| Udk | 519.161, 519.68, 510.5, 519.681 |
| Location | San Francisco |
| Keywords | Algoritmer, Nonnumerical algorithms and problems, NP-fullständighet, Computational complexity, Algoritmer för programkonstruktion, Computer algorithms |