Video: Matthias Poloczek, "Limitations of greedy algorithms for MAX SAT"

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

Thursday, August 7, 2014 10:09 - 10:36

Limitations of greedy algorithms for MAX SAT

Matthias Poloczek, Video: Limitations of greedy algorithms for MAX SAT

Matthias Poloczek, Limitations of greedy algorithms for MAX SAT, Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 14w5051, math, mathematics, video

Banff International Research Station

presentation

mpeg4

80M

http://www.birs.ca/events/2014/5-day-workshops/14w5051/videos

http://www.birs.ca/events/2014/5-day-workshops/14w5051/videos/watch/201408071009-Poloczek.html

Limitations of greedy algorithms for MAX SAT

Matthias Poloczek at 14w5051: Approximation Algorithms and the Hardness of Approximation on Thursday, August 7, 2014

0 seconds of 0 secondsVolume 0%

00:00

Download this video (80M)