Theory of Computational Complexity, , Wiley, Ding-Zhu Du, Ker-I Ko,Discrete mathematics,Mathematics, Theory of Computational Complexity; Ding-Zhu Du; np-hard optimization; APX-hardness; (log n)-approximation; game conjecture; NP-completeness theory; nonuniform computational complexity; decision trees; Boolean circuits; PCP Theorems,, Wiley Series in Discrete Mathematics and Optimization, United States, en-UShttps://www.wiley.comTheory of Computational Complexity; Ding-Zhu Du; np-hard optimization; APX-hardness; (log n)-approximation; game conjecture; NP-completeness theory; nonuniform computational complexity; decision trees; Boolean circuits; PCP Theorems, [BLURB],[CITY],,books, ebooks, biblet, Book2look