lower bounds for subexponential parameterized complexity of minimum fill-in and related problems
Published 8 years ago • 507 plays • Length 33:06Download video MP4
Download video MP3
Similar videos
-
29:28
subexponential parameterized complexity of completion problems: survey of the upper bounds
-
25:26
lower bounds for problems parameterized by clique-width
-
31:14
new unconditional lower bounds for algorithms and enumeration problems
-
1:00:42
lower bounds in arithmetic circuit complexity i
-
55:20
lower bounds against pc with extension variables
-
56:53
lower bounds for dynamic data structures i
-
27:06
on the subexponential time complexity of the csp
-
1:02:22
lower bounds techniques in proof complexity ii
-
55:19
lower bounds for subgraph isomorphism and consequences in first-order logic
-
47:32
parameterized inapproximability of the minimum distance problem over all fields...
-
52:45
new lower bounds and derandomization for acc, and a...
-
47:35
unprovability of strong complexity lower bounds in bounded arithmetic
-
42:53
proof complexity lower bounds from graph expansion and combinatorial games
-
17:02
derandomization via robust algebraic circuit lower bounds
-
1:07:50
lower bounds on statistical estimation rates under various constraints
-
51:51
lower bounds on the size of linear programs
-
48:27
new upper and lower bounds on approximate counting