Computers and intractability : a guide to the theory of NP-completeness /
Huvudupphovsman: | Garey, Michael R. |
---|---|
Övriga upphovsmän: | Johnson, David S., 1945- (joint author.) |
Materialtyp: | Bok |
Språk: | English |
Publicerad: |
New York ; Houndmills ; San Francisco :
W. H. Freeman,
c1979.
|
Serie: | A Series of books in the mathematical sciences
|
Ämnen: | |
Classic Catalogue: | View this record in Classic Catalogue |
Liknande verk
-
P, NP, and NP-Completeness
av: Oded Goldreich
Publicerad: (2012) -
Modern Computer Arithmetic
av: Richard P. Brent, Paul Zimmermann
Publicerad: (2012) -
Tractability
av: Edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli
Publicerad: (2014) -
Iterative Methods in Combinatorial Optimization
av: Lap Chi Lau, R. Ravi, Mohit Singh
Publicerad: (2012) -
Theory of computation /
av: Sipser, Michael
Publicerad: (2007)