4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 4 cited
Faster Deterministic Modular Subset Sum
Krzysztof Potępa
We consider the Modular Subset Sum problem: given a multiset of integers from and a target integer , decide if there exists a subset of with a sum equal t…
cs.CC2020★ 1 cited
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time
Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder +2
We consider integer and linear programming problems for which the linear constraints exhibit a (recursive) block-structure: The problem decomposes into independent and efficiently…