New lower bounds and algorithms for all query arities: stretched shallow circuits provably avoid almost k-wise independent strings, with an efficiently certifiable proof.
Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
New lower bounds and algorithms for all query arities: stretched shallow circuits provably avoid almost k-wise independent strings, with an efficiently certifiable proof.