k-SUM in the Sparse Regime: Complexity and Applications
Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan
2024Year
4Citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get d631dcac-90cd-4bed-a776-997d2da3baf8Related papers
- Hardness and Algorithms for Robust and Sparse OptimizationEric Price, Sandeep Silwal, Samson ZhouICML 2022 · 10 citations
- Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XORItai Dinur, Nathan Keller, Ohad KleinFOCS 2021 · 2 citations
- Testing noisy linear functions for sparsityXue Chen, Anindya De, Rocco A. ServedioSTOC 2020 · 1 citation
- Z3str4: A Multi-armed String SolverFederico Mora, Murphy Berzish, Mitja Kulczynski, Dirk Nowotka et al.FM 2021 · 30 citations
- Top-k-convolution and the quest for near-linear output-sensitive subset sumKarl Bringmann, Vasileios NakosSTOC 2020 · 18 citations
