Jesper Nederlof

activity

20112026

most citedOn Problems as Hard as CNFSAT

121 citations · 181 across the 38 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.DS2025

Weighted $k$ -Path and Other Problems in Almost $O^{*} (2^{k})$ Deterministic Time via Dynamic Representative Sets

Jesper Nederlof

We present a data structure that we call a Dynamic Representative Set. In its most basic form, it is given two parameters $0 < k < n$ and allows us to maintain a representation of a…

cs.DS2025

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms

Andreas Björklund, Petteri Kaski, Tomohiro Koana +1

We show that sufficiently low tensor rank for the balanced tripartitioning tensor $P_{d} (x, y, z) = \sum_{A, B, C \in (d [ 3 d ]) : A \cup B \cup C = [3 d]} x_{A} y_{B} z_{C}$ for a large enough constan…

Weighted k-Path and Other Problems in Almost O∗(2k) Deterministic Time via Dynamic Representative Sets

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms

Weighted $k$ -Path and Other Problems in Almost $O^{*} (2^{k})$ Deterministic Time via Dynamic Representative Sets