Peter Rossmanith
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 Bounds on the Space Complexity of Dynamic Programming | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Proves a formal space lower bound for dynamic programming on tree decompositions by switching to a one-way read-only input Turing model and constructing ~k·3^k… | ||
| nothing matches | ||