Bøker av Ding-Zhu (University of Minnesota) Du

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.

Language theory, automata, and complexity theory are essential topics in the field of computer science. In this volume, two established experts offer practical, accessible coverage of these issues with an emphasis on problem-solving skills.