Can I read Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) on EtoBox?

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) by Ding-Zhu Du, Ker-I Ko is a nonfiction available to read on EtoBox.

What is Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) about?

Praise for the First Edition "...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." - Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition , examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additio

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

Author

Ding-Zhu Du, Ker-I Ko

Publisher

John Wiley & Sons, Incorporated

Published

2014

Language

EN

ISBN

9781118306086

Category

nonfiction

Subjects

Mathematics, Science, Stem