Computational Complexity
% SALE
Computational Complexity
% SALE
% SALE
Description
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.
Product details
- Type:
- Book
- Binding:
- Paperback
- Edition:
- 1
- Languages:
-
Published:
English
,
Original:
English
- Number of Pages:
-
523
- Publisher:
-
Pearson
- Publication Date:
-
1994-01-19
- Release Date:
-
1994-01-01
- ISBN / EAN:
-
9780201530827
- Weight:
-
839 g
- Dimensions:
-
23/3/15 cm
Die gelieferte Auflage kann ggf. abweichen.
Currently sold out
Back in stock email
Add to Wishlist