Video: Mohit Singh, "Computability of maximum entropy distributions and counting problems"

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

Mohit Singh, Microsoft Research, Redmond

Monday, August 4, 2014 10:11 - 10:38

Computability of maximum entropy distributions and counting problems

Mohit Singh, Video: Computability of maximum entropy distributions and counting problems

Mohit Singh, Computability of maximum entropy distributions and counting problems, Approximation Algorithms and the Hardness of Approximation, BIRS, BIRS talk, 14w5051, math, mathematics, video

Banff International Research Station

presentation

mpeg4

78M

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

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

Computability of maximum entropy distributions and counting problems

Mohit Singh at 14w5051: Approximation Algorithms and the Hardness of Approximation on Monday, August 4, 2014

0 seconds of 0 secondsVolume 0%

00:00

Download this video (78M)