@Article{ALMSS98,
  title =   "Proof Verification and the Hardness of Approximation
         Problems",
  author =       "Sanjeev Arora and Carsten Lund and Rajeev Motwani and
         Madhu Sudan and Mario Szegedy",
  area =     "Formal Languages and Complexity Theory",
  journal =      "Journal of the ACM",
  pages =   "501--555",
  year =     "1998",
  volume =       "45",
  number =       "3",
}


@Article{AS98,
  title =   "Probabilistic Checking of Proofs: {A} New
         Characterization of {NP}",
  author =  "Sanjeev Arora and Shmuel Safra",
  journal = "J. ACM",
  year =    "1998",
  number =  "1",
  volume =  "45",
  bibdate = "2003-11-20",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/jacm/jacm45.html#AroraS98",
  pages =   "70--122",
  URL =     "http://doi.acm.org/10.1145/273865.273901",
}

@InProceedings{Bab85,
  author =       "L. Babai",
  title =   "Trading group theory for randomness",
  booktitle =    "Proceedings of the 17th Annual ACM Symposium on Theory
         of Computing, STOC'85 (Providence, RI, May 6-8, 1985)",
  pages =   "421--429",
  year =     "1985",
  publisher =    "ACM Press",
  organization = "ACM",
  address =      "New York",
  cdate =   "1970-01-01",
  mdate =   "2005-08-18",
}

@Article{BM88,
  title =   "Arthur-{Merlin} Games: {A} Randomized Proof System,
         and a Hierarchy of Complexity Classes",
  author =       "L{\'a}szl{\'o} Babai and Shlomo Moran",
  pages =   "254--276",
  journal =      "Journal of Computer and System Sciences",
  year =     "1988",
  month =   apr,
  volume =       "36",
  number =       "2",
  preliminary =  "STOC::Babai1985:421",
}

@InProceedings{BenSud05,
  author =       "Ben-Sasson and Sudan",
  title =   "Simple {PCP}s with Poly-log Rate and Query
         Complexity",
  booktitle =    "STOC: ACM Symposium on Theory of Computing (STOC)",
  year =     "2005",
}

@unpublished{Din05,
  author =       "Dinur, Irit",
  title =        "The PCP theorem by gap amplification",
  note = "ECCC, TR05-046",
  year =         "2005",
}

@Article{Fei98,
  title =   "A Threshold of ln n for Approximating Set Cover",
  author =  "Uriel Feige",
  journal = "J. ACM",
  year =    "1998",
  number =  "4",
  volume =  "45",
  bibdate = "2003-11-20",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/jacm/jacm45.html#Feige98",
  pages =   "634--652",
  URL =     "http://doi.acm.org/10.1145/285055.285059",
}

@Article{FGLSS96,
  author =       "Uriel Feige and Shafi Goldwasser and Laszlo Lov{\'a}sz
         and Shmuel Safra and Mario Szegedy",
  title =   "Interactive proofs and the hardness of approximating
         cliques",
  journal =      "J. ACM",
  pages =   "268--292",
  year =     "1996",
  number =       "2",
  volume =       "43",
  keywords =     "hardness of approximation, independent set in a graph,
         multilinearity testing, NP-completeness,
         probabilistically checkable proofs",
  publisher =    "ACM Press",
  address =      "New York",
  cdate =   "1970-01-01",
  mdate =   "2005-08-18",
}

@Article{FK00,
  author =       "Uriel Feige and Joe Kilian",
  title =   "Two-prover protocols --- Low error at affordable
         rates",
  journal =      "SIAM J. Comput.",
  pages =   "324--346",
  year =     "2000",
  number =       "1",
  volume =       "30",
  keywords =     "interactive proof systems, complexity theory",
  editor =       "M. Yannakakis",
  publisher =    "Society for Industrial and Applied Mathematics",
  address =      "Philadelphia, PA",
  URL =   "http://dx.doi.org/10.1137/S0097539797325375",
  cdate =   "2005-02-03",
  mdate =   "2005-08-18",
}

@InProceedings{GLST98,
  author =       "V. Guruswami and D. Lewin and M. Sudan and L.
         Trevisan",
  title =   "A Tight Characterization of {NP} with 3 Query {PCPs}",
  pages =   "8--17",
  ISBN =     "0-8186-9172-7",
  booktitle =    "Proceedings of the 39th Annual Symposium on
         Foundations of Computer Science({FOCS}-98)",
  month =   nov # "8--11",
  publisher =    "IEEE Computer Society",
  address =      "Los Alamitos, CA",
  year =     "1998",
}

@Article{GMR89,
  title =   "The Knowledge Complexity of Interactive Proof
         Systems",
  author =  "Shafi Goldwasser and Silvio Micali and Charles
         Rackoff",
  journal = "SIAM J. Comput",
  year =    "1989",
  number =  "1",
  volume =  "18",
  bibdate = "2002-01-03",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp18.html#GoldwasserMR89",
  pages =   "186--208",
}

@Article{Has99,
  title = {Clique is hard to approximate to within $n^{1-\epsilon}$},
  author =  "Johan H{\aa}stad",
  journal = "Acta Mathematica",
  volume = 182,
  year = 1999,
  pages = {105-142},
}

@Article{Has01,
  title =   "Some optimal inapproximability results",
  author =  "Johan H{\aa}stad",
  journal = "J. ACM",
  year =    "2001",
  number =  "4",
  volume =  "48",
  bibdate = "2003-11-20",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/jacm/jacm48.html#Hastad01",
  pages =   "798--859",
  URL =     "http://doi.acm.org/10.1145/502090.502098",
}

@Article{HW03,
  title =   "Simple analysis of graph tests for linearity and
         {PCP}",
  author =  "Johan H{\aa}stad and Avi Wigderson",
  journal = "Random Struct. Algorithms",
  year =    "2003",
  number =  "2",
  volume =  "22",
  bibdate = "2004-05-27",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/rsa/rsa22.html#HastadW03",
  pages =   "139--160",
  URL =     "http://dx.doi.org/10.1002/rsa.10068",
}

@Article{IK75,
  title =   "Fast Approximation Algorithms for the Knapsack and Sum
         of Subset Problems",
  author =       "Oscar H. Ibarra and Chul E. Kim",
  area =     "Complexity of Computation",
  pages =   "463--468",
  journal =      "Journal of the ACM",
  month =   oct,
  year =     "1975",
  volume =       "22",
  number =       "4",
}

@Article{Joh74,
  title =   "Approximation Algorithms for Combinatorial Problems",
  author =  "David S. Johnson",
  journal = "J. Comput. Syst. Sci",
  year =    "1974",
  number =  "3",
  volume =  "9",
  bibdate = "2003-11-20",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/jcss/jcss9.html#Johnson74a",
  pages =   "256--278",
}

@Article{LY94,
  title =   "On the Hardness of Approximating Minimization
         Problems",
  author =  "Carsten Lund and Mihalis Yannakakis",
  journal = "J. ACM",
  year =    "1994",
  number =  "5",
  volume =  "41",
  bibdate = "2003-11-20",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/jacm/LundY94.html;
         DBLP,
         http://dblp.uni-trier.de/db/journals/jacm/jacm41.html#LundY94",
  pages =   "960--981",
  URL =     "http://doi.acm.org/10.1145/185675.306789",
}

@Article{Raz98,
  title =   "A Parallel Repetition Theorem",
  author =  "Ran Raz",
  journal = "SIAM J. Comput",
  year =    "1998",
  number =  "3",
  volume =  "27",
  bibdate = "2002-01-03",
  bibsource =   "DBLP,
         http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp27.html#Raz98",
  pages =   "763--803",
}

@InProceedings{ST00,
  author =       "Alex Samorodnitsky and Luca Trevisan",
  title =   "A {PCP} characterization of ${NP}$ with optimal
         amortized query complexity",
  booktitle =    "Proceedings of the 32nd Annual ACM Symposium on Theory
         of Computing, STOC'2000 (Portland, Oregon, May 21-23,
         2000)",
  pages =   "191--199",
  year =     "2000",
  publisher =    "ACM Press",
  address =      "New York",
  cdate =   "1970-01-01",
  mdate =   "2005-08-18",
}

@unpublished{Zuc05,
  author =       "Zuckerman, David",
  title =        "Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number",
  note = "ECCC, TR05-100",
  year =         "2005",
}