近似算法的极限：PCPs和唯一博弈（DIMACS系列讲义）
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
摘要：
这些是2009年7月20-21日在罗格斯大学核心大楼DIMACS中心举行的DIMACS研讨会“近似算法的极限：PCP和独特游戏”的讲义。本教程由DIMACS Special Focus on Hardness of Approximation、DIMACS Special Focus on Mathematic Foundations of the Internet和Center for Computational Intractability联合主办，并得到了美国国家安全局和美国国家科学基金会的支持。该教程的演讲者是Matthew Andrews、Sanjeev Arora、Moses Charikar、Prahladh Harsha、Subhash Khot、Dana Moshkovitz和Lisa Zhang。他们是Ashkan Aazami，Dev Desai，Igor Gorobrsky，Geetha Jagannathan，Alexander S。Kulikov，Darakhshan J. Mir，Alantha Newman，Aleksandar Nikolov，David Pritchard and Gwen Spencer.
英文摘要：
These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-21 July, 2009. This tutorial was jointly sponsored by the DIMACS Special Focus on Hardness of Approximation, the DIMACS Special Focus on Algorithmic Foundations of the Internet, and the Center for Computational Intractability with support from the National Security Agency and the National Science Foundation. The speakers at the tutorial were Matthew Andrews, Sanjeev Arora, Moses Charikar, Prahladh Harsha, Subhash Khot, Dana Moshkovitz and Lisa Zhang. The sribes were Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard and Gwen Spencer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
