Henning Fernau
where else to find them
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 Bound Results for Hard Problems Related to Finite Automata | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Shows ETH-based lower bounds for universality, inequivalence and intersection-nonemptiness on NFAs/DFAs by encoding SAT and 3-coloring into unary/bounded… | ||
| nothing matches | ||