Holger Dell
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Fine-Grained Complexity Classification of Counting Problems | The Classification Program of Counting Complexity | 2016-03-28 |
Fine-grained classification ties concrete running times to counting problems: CNF counting resists sub- (1+δ)^n algorithms under SETH/ETH, with examples like… | ||
| Fine-Grained Counting Complexity I | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Shows a concrete chain: counting 3D‑matching reduces to counting k‑matchings in bipartite graphs via a tiny gadget whose counts cancel mod p, recovers exact… | ||
| nothing matches | ||