Video From 14w5051: Approximation Algorithms and the Hardness of Approximation

Wednesday, August 6, 2014 10:08 - 10:39
(2+ε)-SAT is NP-hard
Per Austrin, Video: (2+ε)-SAT is NP-hard
Per Austrin, Video: (2+ε)-SAT is NP-hard
Per Austrin, (2+ε)-SAT is NP-hard, Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 14w5051, math, mathematics, video
Banff International Research Station
Banff International Research Station
presentation
mpeg4
125M
http://www.birs.ca/events/2014/5-day-workshops/14w5051/videos

Download this video (125M)

Other videos from this workshop