stacs 2021 | inapproximability of diameter in super-linear time: beyond the 5/3 ratio
Published 3 years ago • 48 plays • Length 26:10Download video MP4
Download video MP3
Similar videos
-
26:28
stacs 2021 | reachability in two-parametric timed automata with one parameter is expspace-complete
-
31:06
stacs 2021 | binary matrix completion under diameter constraints
-
24:31
stacs 2021 | bidimensional linear recursive sequences and universality of unambiguous register au...
-
24:34
stacs 2021 | symmetric promise constraint satisfaction problems: beyond the boolean case
-
21:43
stacs 2021 | rice-like theorems for automata networks
-
21:09
stacs 2021 | parameterised counting in logspace
-
25:49
stacs 2021 | efficiently testing simon’s congruence
-
28:46
stacs 2021 | simple multi-pass streaming algorithms for skyline points and extreme points
-
4:44
first day of uni | htw saar | saarbrücken
-
7:02
saarbrücken vlog, germany , europe 🇩🇪❤️
-
8:02
snow covered saarland university
-
25:54
stacs 2021 | the edit distance to k-subsequence universality
-
27:53
stacs 2021 | a faster algorithm for finding tarski fixed points
-
25:09
stacs 2021 | solving one variable word equations in the free group in cubic time
-
16:19
stacs 2021 | finding an optimal alphabet ordering for lyndon factorization is hard
-
24:41
stacs 2021 | tight approximation guarantees for concave coverage problems
-
1:22
sat math (probability)
-
22:24
stacs 2021 | absorbing patterns in bst-like expression-trees
-
25:34
stacs 2021 | diverse collections in matroids and graphs
-
25:31
stacs 2021 | on euclidean steiner 1 ε-spanners
-
22:57
stacs 2021 | cluster editing parameterized above modification-disjoint p₃-packings
-
23:21
stacs 2021 | achieving anonymity via weak lower bound constraints for k-median and k-means