COMPUTERS AND INTRACTABILITY A GUIDE TO THE THEORY OF NP-COMPLETENESS
by Michael R. Garey; David S. Johnson
Published by W.H. Freeman and Company. 1st USA. 1979
Slightly better than very good condition. Large format. Card wraps. This book is suitable as a supplement to courses in algorithm design, computational complexity, operations research or combinatorial mathematics and as a text for seminars on approximation algorithms or computational complexity.
Light creasing to cover edges. Name in ink to inside front cover. Light foxing to outer page edges.
ISBN: 0716710455
Stock no. 2120142
- Categorised in:
- SCIENCE AND TECHNOLOGY
- MATHS
- TEXT BOOK (UNIVERSITY)
- COMPUTING
Sorry this book has been sold
(28/07/2017)
Enquire about this book
Create want