5 citations · 19 across the 20 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 1 cited
Fast and Simple Modular Subset Sum
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann +4
We revisit the Subset Sum problem over the finite cyclic group for some given integer . A series of recent works has provided near-optimal algorithms for this pro…
cs.IT2020
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
Mahdi Cheraghchi, Vasileios Nakos
In the long-studied problem of combinatorial group testing, one is asked to detect a set of defective items out of a population of size , using disjunctive measure…