Upper Bounds for CSP Non-redundancy via Locally Decodable Codes
cs.DM, cs.CC, cs.IT, math.CO, math.IT
Submitted: 2026-10-28
Updated: 2026-10-28
Comments: 24 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns