Petr Golovach
where else to find them
no profile links on file
what they talk about
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 |
|---|---|---|
| Lower Bounds for Problems Parameterized by Clique-width | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Claim: several classic problems (Dominating Set, Independent Set, Hamiltonian Cycle, Feedback Vertex Set) admit no algorithms of form 2^{o(k)}·n^{O(1)} when… | ||
| nothing matches | ||