Theory of Computational Complexity By: Ding-Zhu Du, Ker-I Ko

Author: Ker-I Ko

Computational complexity is an area of increasing importance and deep mathematical results, many of which have substantial practical relevance. The field will continue to be important due to the continuing development of the technology and due also to the increasing links with other disciplines. This book is a comprehensive reference in computational complexity theory, and contains the complete treatment of the major topics, including Turing-machine based on complexity theory, NP-completeness theory, probabilistic complexity, decision tree complexity and circuit complexity.

3.3M	Theory of Computational Complexity (2014, Wiley) - Ding-Zhu Du, Ker-I Ko.pdf
3.3M	total