Tselil Schramm, Video: (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

Tselil Schramm, Video: (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

Tselil Schramm, (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs, Analytic Techniques in Theoretical Computer Science, BIRS, BIRS talk, 18w5197, math, mathematics, video

Banff International Research Station

Banff International Research Station

presentation

mpeg4

208M

http://www.birs.ca/events/2018/5-day-workshops/18w5197/videos

http://www.birs.ca/events/2018/5-day-workshops/18w5197/videos/watch/201808131633-Schramm.html