karl bringmann: pseudopolynomial-time algorithms for optimization problems
Published 2 years ago • 227 plays • Length 1:01:28Download video MP4
Download video MP3
Similar videos
-
22:35
adam polak: knapsack and subset sum with small items
-
9:01
brent's minimization method
-
2:21
top 20 country by international mathematical olympiad gold medal (1959-2019)
-
10:55
interview at cirm : peter scholze
-
8:24
a really interesting floor problem!
-
0:59
polynomial time decidable problems - intro to algorithms
-
29:08
hans bodlaender: parameterized problems complete for nondeterministic fpt time and logarithmic space
-
59:22
panorama of mathematics: michel goemans
-
17:49
quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
-
26:19
francisco criado: the dual 1-fair packing problem and applications to linear programming
-
27:18
anja fischer: polynomial matroid optimisation problems
-
8:14
time complexity problem
-
1:01:18
a polynomial-time algorithm for finding ground states of gapped local hamiltonians in 1d
-
41:01
sublinear time local-access random generators
-
2:27
the algebra of timetabling