Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Купить бумажную книгу и читать

Название: Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

автор: Ding-Zhu Du, Ker-I Ko

Издательство: Wiley

Год выпуска: 2014

ISBN: 978-1118306086

Формат: PDF

Размер: 17 MB

Количество страниц: 512

Язык: Английский

Описание: Providing the basic theory and methods that are essential for understanding complexity theory, this second edition of Theory of Computational Complexity emphasizes advances in the field of computational complexity, including newly developed algorithms and novel applications to quantum computing. Serving as a comprehensive resource for students and practitioners on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered, the new edition features complete proofs relating to recent breakthroughs in complexity theory, reflecting the latest developments in the field.