Swastik Kopparty, Video: Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Swastik Kopparty, Video: Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Swastik Kopparty, Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity, Computational Complexity, BIRS, BIRS talk, 13w5010, math, mathematics, video

Banff International Research Station

Banff International Research Station

presentation

mpeg4

168M

http://www.birs.ca/events/2013/5-day-workshops/13w5010/videos

http://www.birs.ca/events/2013/5-day-workshops/13w5010/videos/watch/201307101115-Kopparty.html