lower bounds for set-multilinear branching programs - shubhangi saraf
Published 6 months ago • 1.9K plays • Length 1:17:14Download video MP4
Download video MP3
Similar videos
-
53:14
ac seminar: shubhangi saraf - new lower bounds for set multilinear forms
-
1:48:39
tight lower bounds for 2-query lccs over finite fields - shubhangi saraf
-
38:14
proving super-polynomial lower bounds for syntactic multilinear branching programs by ramya c
-
1:52:58
the chasm at depth 3 - shubhangi saraf
-
2:07:43
nutan limaye: superpolynomial lower bounds against low-depth algebraic circuits
-
1:15:47
tcs talk: shubhangi saraf (2014/02/12)
-
4:26
liberating complexity
-
39:49
1. the geometry of linear equations
-
1:09:40
non-orientable lagrangian fillings of legendrian knots - joshua sabloff
-
1:06:45
on the number of ordinary lines determined by sets in complex space - shubhangi saraf
-
1:00:38
lower bounds on the size of semidefinite programming relaxations - steurer
-
32:54
parameterized lower bounds on multilinear algebraic models by purnata ghosal
-
1:00:10
minimum linearizations of multilinear programs - arvind raghunathan
-
19:24
towards tight i/o lower bounds for statically analyzable programs
-
1:13:43
locally testable and locally correctable codes approaching the gv bound - shubhangi saraf
-
16:47
incidence geometry and connections to theoretical computer science - shubhangi saraf
-
1:01:51
small-depth multilinear formula lower bounds for iterated matrix multiplication with applications