Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Product Description
Condition - Very Good
The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
- Used Book in Good Condition
Technical Specifications
You might also like
Introduction to Algorithms, 3rd Edition (The MIT Press)
Introduction to the Theory of Computation
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Computer Algorithms
Structure and Interpretation of Computer Programs - 2nd Edition (MIT Electrical Engineering and Computer Science)
The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition (Springer Series in Statistics)
Algorithms
Pattern Recognition and Machine Learning (Information Science and Statistics)
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine
Computer Architecture: A Quantitative Approach (The Morgan Kaufmann Series in Computer Architecture and Design)