the simple, little and slow things count: on parameterized counting complexity
Published 8 years ago • 270 plays • Length 1:07:30Download video MP4
Download video MP3
Similar videos
-
1:02:06
fine-grained counting complexity ii
-
1:02:04
fine-grained counting complexity i
-
1:05:21
parameterized reductions
-
30:56
fine-grained complexity classification of counting problems
-
29:28
subexponential parameterized complexity of completion problems: survey of the upper bounds
-
47:02
the computational complexity of counting list h-colourings, and related problems
-
47:20
counting approximation complexity classification through clones and invariants
-
48:27
new upper and lower bounds on approximate counting
-
3:53
a simple logic test many cannot pass
-
1:16:16
brian greene - reaching for einstein's dream
-
33:06
lower bounds for subexponential parameterized complexity of minimum fill-in and related problems
-
29:08
an isomorphism between parameterized complexity and classical complexity, for both time and space
-
26:24
counting subgraphs in somewhere dense graphs
-
28:26
the logic of counting query answers
-
33:21
sos and the dreaded bit-complexity
-
1:36:31
sub-linear time algorithms: fast, cheap and (only a little) out of control
-
46:27
dichotomies for counting subgraphs
-
10:08
1.5.1 time complexity #1
-
1:00:14
the classification program for counting problems i
-
1:08:04
new progress on the (parameterized?) circuit size problem 3