Tselil Schramm (Harvard/MIT) -- Efficient Algorithms for the Graph Matching Problem

Name: Tselil Schramm (Harvard/MIT) -- Efficient Algorithms for the Graph Matching Problem
Uploaded: Oct 17, 2018
Duration: 3085 s
Description: MIFODS - Statistics joint seminar. Cambridge, US October 5, 2018 Full title: (Nearly) Efficient Algorithms for the Graph Matching Problem

FODSI2.4K subscribers

1.4K views

Oct 17, 2018

51:25

MIFODS - Statistics joint seminar. Cambridge, US October 5, 2018 Full title: (Nearly) Efficient Algorithms for the Graph Matching Problem

Download

0 formats

No download links available.