2002年Nevalinna奖获得者Madhu Sudan的作品
On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner
摘要:
Madhu Sudan的工作跨越了计算机科学理论的许多领域,包括计算复杂性理论、高效算法的设计、算法编码理论以及程序检查和纠正理论。苏丹的两个结果在它们对计算数学的影响中脱颖而出。第一项工作显示了NP类的概率特征-这些集的成员资格存在短,易于检查的证明,并演示了这种特征的后果,以分类的复杂性近似问题。第二部分给出了里德-所罗门纠错码的列表译码的多项式时间算法。这个简短的说明将致力于描述苏丹的工作概率可查证明-所谓的{ \it PCP定理}及其影响。
英文摘要:
Madhu Sudan's work spans many areas of computer science theory including computational complexity theory, the design of efficient algorithms, algorithmic coding theory, and the theory of program checking and correcting. Two results of Sudan stand out in the impact they have had on the mathematics of computation. The first work shows a probabilistic characterization of the class NP -- those sets for which short and easily checkable proofs of membership exist, and demonstrates consequences of this characterization to classifying the complexity of approximation problems. The second work shows a polynomial time algorithm for list decoding the Reed Solomon error correcting codes. This short note will be devoted to describing Sudan's work on probabilistically checkable proofs -- the so called {\it PCP theorem} and its implications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。