Kasper Green Larsen

activity

20232025

most citedThe NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

3 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing cs.CGShow all

1 paper · 1 filter

cs.CG2024

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation

Karl Bringmann, Kasper Green Larsen, André Nusser +2

Union volume estimation is a classical algorithmic problem. Given a family of objects $O_{1}, \dots, O_{n} \subseteq R^{d}$ , we want to approximate the volume of their union. In…