We briefly survey a number of important recent uchievements in Theoretical Computer Science （TCS）, especially Computational complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability o...
详细信息
We briefly survey a number of important recent uchievements in Theoretical Computer Science （TCS）, especially Computational complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph connectivity problem; deterministic polynomial-time primality test; latticecomplexity, worst-case to average-case reductions; pseudorandomness and extractor constructions; and Valiant＇s new theory of holographic algorithms and reductions.
暂无评论