Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number

David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Electronic Colloquium on Computational Complexity (ECCC), (100), 2005. [doi]

@article{ECCC-TR05-100,
  title = {Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number},
  author = {David Zuckerman},
  year = {2005},
  url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-100/index.html},
  researchr = {https://researchr.org/publication/ECCC-TR05-100},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  number = {100},
}