VideoArxiv
Home
Workshops
Speakers
Talk page
Title:
(2+ε)-SAT is NP-hard
Speaker:
Per Austrin
Link:
http://www.birs.ca/events/2014/5-day-workshops/14w5051/videos/watch/201408061008-Austrin.html
Workshop:
Birs- 14w5051: Approximation Algorithms and the Hardness of Approximation