stacs 2021 | lower bounds for graph-walking automata
Published 3 years ago • 76 plays • Length 22:08Download video MP4
Download video MP3
Similar videos
-
28:59
stacs 2021 | b-coloring parameterized by clique-width
-
24:33
stacs 2021 | one-tape turing machine and branching program lower bounds for mcsp
-
23:21
stacs 2021 | achieving anonymity via weak lower bound constraints for k-median and k-means
-
15:58
stacs 2021 | spectrum preserving short cycle removal on regular graphs
-
23:55
stacs 2021 | a unified framework of quantum walk search
-
25:04
stacs 2021 | an fpt algorithm for elimination distance to bounded degree graphs
-
26:28
stacs 2021 | reachability in two-parametric timed automata with one parameter is expspace-complete
-
58:41
stacs 2021 | first-order transductions of graphs
-
50:45
andras vasy - waves on kerr-de sitter space
-
15:50
c stl numeric - std::accumulate (fold) | modern cpp series ep. 183
-
49:21
chris godsil: problems with continuous quantum walks
-
12:08
stacs 2021 | complexity of the list homomorphism problem in hereditary graph classes
-
29:45
stacs 2021 | exploiting dense structures in parameterized complexity
-
26:56
stacs 2021 | a ramsey theorem for finite monoids
-
21:09
stacs 2021 | parameterised counting in logspace
-
25:04
stacs 2021 | online simple knapsack with reservation costs
-
25:31
stacs 2021 | on euclidean steiner 1 ε-spanners
-
1:07:35
stacs 2021 | optimization, complexity and invariant theory
-
24:16
stacs 2021 | a nearly optimal deterministic online algorithm for non-metric facility location
-
22:54
a2.e – scheduling lower bounds via and subset sum
-
31:06
stacs 2021 | binary matrix completion under diameter constraints
-
25:04
stacs 2021 | a characterization of wreath products where knapsack is decidable