On Hardness of Approximating the Parameterized Clique Problem

Subhash Khot, Igor Shinkar. On Hardness of Approximating the Parameterized Clique Problem. Electronic Colloquium on Computational Complexity (ECCC), 22:13, 2015. [doi]

@article{KhotS15,
  title = {On Hardness of Approximating the Parameterized Clique Problem},
  author = {Subhash Khot and Igor Shinkar},
  year = {2015},
  url = {http://eccc.hpi-web.de/report/2015/013},
  researchr = {https://researchr.org/publication/KhotS15},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {22},
  pages = {13},
}