Towards Hardness of Approximation for Polynomial Time Problems

Amir Abboud, Arturs Backurs. Towards Hardness of Approximation for Polynomial Time Problems. In Christos H. Papadimitriou, editor, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA. Volume 67 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{AbboudB17-0,
  title = {Towards Hardness of Approximation for Polynomial Time Problems},
  author = {Amir Abboud and Arturs Backurs},
  year = {2017},
  doi = {10.4230/LIPIcs.ITCS.2017.11},
  url = {http://dx.doi.org/10.4230/LIPIcs.ITCS.2017.11},
  researchr = {https://researchr.org/publication/AbboudB17-0},
  cites = {0},
  citedby = {0},
  booktitle = {8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA},
  editor = {Christos H. Papadimitriou},
  volume = {67},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-029-3},
}