SIGACT news complexity theory column 38
SIGACT news complexity theory column 38
复制标题
SIGACT新闻复杂性理论专栏38
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
L. Hemaspaandra
中科院分区：
文献类型：
--
作者：
L. Hemaspaandra
在本调查中，我们重点介绍了本列第I部分的完整问题，并包括其中的一些问题。使用错误校正代码的两个不可毒性的证明。 S. Wabash Ave.，芝加哥，伊利诺伊州60604，美国，schaefer@cs.depaul.edu。
In this survey, we highlight selected complete problems from Part I of this column, and include reductions for some of them. We also discuss methods for proving hardness of approximation in the second and higher levels of the Polynomial-Time Hierarchy, and illustrate them with two full proofs of non-approximability utilizing error-correcting codes. 1 c ©Marcus Schaefer and Chris Umans, 2002. School of CTI, DePaul Univ., 243 S. Wabash Ave., Chicago, IL 60604, USA, schaefer@cs.depaul.edu. Computer Science Dept., Caltech, 1200 East California Blvd., Pasadena, CA 91125, USA, umans@cs.caltech.edu.