activity
20242026
most citedTight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling

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

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2024

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

Karl Bringmann, Allan Grønlund, Marvin Künnemann +1

We pose the fine-grained hardness hypothesis that the textbook algorithm for the NFA Acceptance problem is optimal up to subpolynomial factors, even for dense NFAs and fixed alphab…