Hardness of Approximation (Invited Talk)

Author Subhash Khot



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2016.3.pdf
  • Filesize: 202 kB
  • 1 pages

Document Identifiers

Author Details

Subhash Khot

Cite AsGet BibTex

Subhash Khot. Hardness of Approximation (Invited Talk). In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.ICALP.2016.3

Abstract

The talk will present connections between approximability of NP-complete problems, analysis, and geometry, and the role played by the Unique Games Conjecture in facilitating these connections.
Keywords
  • NP-completeness
  • Approximation algorithms
  • Inapproximability
  • Probabilistically Checkable Proofs
  • Discrete Fourier analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail