DIMACS Tutorial on Limits of Approximation Algorithms: PCPs and Unique Games

July 20 - 21, 2009
DIMACS Center, CoRE Building, Rutgers University

Prahladh Harsha, University of Texas, Austin
Moses Charikar, Princeton University
This tutorial is 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.

Other Workshops
DIMACS Homepage
Contacting the Center
Document last modified on May 6, 2010.