RSA Mart

  • Home
  • New Products

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Disclaimer: As an Amazon Associate I may earn from qualifying purchases

Buy Now From Amazon

Product Review

  • Used Book in Good Condition

Similar Products

Introduction to Algorithms, 3rd Edition (The MIT Press)Introduction to the Theory of ComputationCombinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)Computer AlgorithmsStructure 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)AlgorithmsPattern 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 MachineComputer Architecture: A Quantitative Approach (The Morgan Kaufmann Series in Computer Architecture and Design)

Recent Posts

Wahl Color Pro Cordless Rechargeable Hair Clipper & Trimmer

Unlock! Timeless Adventures

Thermometer for Adults, Forehead, and Ear

Disclaimer

RSA Mart is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to amazon.com. Amazon, the Amazon logo, AmazonSupply, and the AmazonSupply logo are trademarks of Amazon.com, Inc. or its affiliates.

Facebook

Copyright © 2020 - All rights reserved