An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
307 views · Published 10 November 2015 · 29:08 · Indexed 20 September 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Yijia Chen, Fudan University Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms https://simons.berkeley.edu/talks-yijia-chen-2015-11-06
More from this channel
-
34:02
Modelling Gene Expression Dynamics with Gaussian Processes
-
37:26
Telomere Length, Nature and Nurture
-
44:30
Sum of Squares SDP Relaxations on Random Tensors
-
1:05:05
Beyond Worst-Case Analysis II
-
1:04:11
Logic and Databases II
-
35:26
Operations on Languages and Codensity Monads
-
35:19
Logic and Bisimulation for Guarded Teams
-
38:58
Automata Learning -- Infinite Alphabets and Application to Verification