Sensitivity and Locality Lower Bounds via Low-Soundness Label Cover
cs.DS
Submitted: 2026-04-02
Updated: 2026-11-05
Terminology
Sources
- High Rate Efficient Local List Decoding from HDX
- From Generative to Episodic: Sample-Efficient Replicable Reinforcement Learning
- Low-soundness direct-product testers and PCPs from Kaufman--Oppenheim complexes
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles