Jesper Nederlof

activity

20112026

most citedReducing a Target Interval to a Few Exact Queries

14 citations · 37 across the 21 of their papers we have counts for

collaborators

Showing 2016 · cs.DSShow all

2 papers · 2 filters

cs.DS2016

Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems

Nikhil Bansal, Shashwat Garg, Jesper Nederlof +1

We present space efficient Monte Carlo algorithms that solve Subset Sum and Knapsack instances with $n$ items using $O^{*} (2^{0.86 n})$ time and polynomial space, where the $O^*(\cdot…

cs.DS2016

Finding Large Set Covers Faster via the Representation Method

Jesper Nederlof

The worst-case fastest known algorithm for the Set Cover problem on universes with $n$ elements still essentially is the simple $O^{*} (2^{n})$ -time dynamic programming algorithm, and n…