External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Amir Abboud

This author has not been identified. Look up 'Amir Abboud' in Google

Arturs Backurs

This author has not been identified. Look up 'Arturs Backurs' in Google
runs on