Karl Bringmann
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 and Algorithm Design for Graph Reachability and Distance Problems | Fine-Grained Complexity, Logic, and Query Evaluation 2023 | 2023-09-22 |
Graphs reachability and shortest-paths reduce to specific matrix products: transitive closure is equivalent to Boolean matrix multiplication and APSP to… | ||
| Conditional Lower Bounds for Longest Common Subsequence | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Proves conditional lower bounds for Longest Common Subsequence under SETH-based reductions by reducing Orthogonal Vectors into fine-grained parameter settings… | ||
| nothing matches | ||