Computational Complexity (Hardback)
$132.14 - Save $6.66 (4%) - RRP $138.80 Free shipping worldwide (to United States and
all these other countries) Usually dispatched within 48 hours
Short Description for Computational Complexity Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, and more.
- Published: 01 January 1994
- Format: Hardback 500 pages
- ISBN 13: 9780201530827 ISBN 10: 0201530821
- Sales rank: 840,831
$105.92 - Save $43.08 28% off - RRP $149.00
$42.80 - Save $7.15 14% off - RRP $49.95
$73.43 - Save $6.52 (8%) - RRP $79.95
$83.78 - Save $6.17 (6%) - RRP $89.95
Full description for Computational Complexity
This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.