Fedor Fomin
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Fine-Grained Complexity of Exact Algorithms | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Shows an ETH-based lower bound: G→H cannot be solved in |H|^{o(|G|)} time (unless ETH fails) via a reduction from 3‑coloring that groups R original vertices… | ||
| nothing matches | ||