Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

Details Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

2010-02-20

arxiv.org/abs/1002.3864v1

Computer Science

Computational Complexity

74 pages, lecture notes

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692477