fine-grained complexity and algorithm design for graph reachability and distance problems
Published Streamed 1 year ago • 457 plays • Length 52:08Download video MP4
Download video MP3
Similar videos
-
54:03
fine grained complexity
-
16:51
shortest paths, dynamic algorithms, and fine-grained complexity
-
59:53
conditional hardness and fine-grained complexity
-
57:01
fine-grained complexity of exact algorithms
-
1:02:04
fine-grained counting complexity i
-
59:49
fine-grained complexity 1
-
1:02:06
fine-grained counting complexity ii
-
![[popl'23] the fine-grained complexity of cfl reachability](https://i.ytimg.com/vi/PNg5JeXL7us/mqdefault.jpg)
26:28
[popl'23] the fine-grained complexity of cfl reachability
-
21:19
the new p
-
1:08:52
owos: guoyin li - "estimating the exponents of kl inequality & error bounds for optimization models"
-
45:24
simulating branching programs with edit distance and friends
-
17:49
quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
-
1:00:15
hardness for dynamic problems; conclusion and future research
-
2:00:28
hardness of easy problems and fine-grained complexity - or zamir
-
45:30
distributed graph techniques in the mpc model