filmov
tv
STOC 2023 - Session 1B - Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
Показать описание
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
Soheil Behnezhad (Northeastern University); Mohammad Roghani, Aviad Rubinstein (Stanford University)
Soheil Behnezhad (Northeastern University); Mohammad Roghani, Aviad Rubinstein (Stanford University)
0:33:45
0:23:15
0:21:46
0:26:19
0:19:36
0:32:47
0:46:09
0:27:49
0:26:30
0:25:06
0:21:08
0:18:13
0:22:51
0:16:51
0:32:34
0:26:34
0:25:26
0:24:07
0:23:33
0:29:46
0:25:21
0:25:00
0:24:24
0:29:47