2026-07-27T00:38:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6339 2024-03-06T10:37:37Z ddc:004 open_access

Hardness of Approximation (Invited Talk) Khot, Subhash NP-completeness Approximation algorithms Inapproximability Probabilistically Checkable Proofs Discrete Fourier analysis 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Subhash Khot 2016 Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2016.3 urn:nbn:de:0030-drops-63395 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.3 eng https://creativecommons.org/licenses/by/3.0/legalcode