COMPUTATIONAL COMPLEXITY
Passe o mouse na imagem para ver detalhes Ampliar

COMPUTATIONAL COMPLEXITY

This new 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 field as computability, logic, number theory, combinatorics, and probability.
Editora: ADDISON WESLEY
ISBN: 0201530821
ISBN13: 9780201530827
Edição: 1ª Edição - 1993
Número de Páginas: 523
Acabamento: PAPERBACK
por R$ 704,00 4x de R$ 176,00 sem juros