Making the long code shorter, with applications to the unique games conjecture
Boaz Barak Microsoft Corporation
This web presentation contains the
audio and slides
of a lecture given at the Fields Institute on August 14, 2011
as part of the Workshop on Approximability of CSPs.
If the format you are requesting has not been viewed recently, expect a 20-30
second delay while it is rebuilt.
You may browse the slides
in the presentation (a browser capable of displaying PNG graphics
is required).
Or, you may download a higher-resolution printer-ready
version
in PDF format
(requires Acrobat Reader).