Upper Bounds for CSP Non-redundancy via Locally Decodable Codes

Joshua Brakensiek, David Conlon, Venkatesan Guruswami +4

In the study of constraint satisfaction problems (CSPs), the non-redundancy of a relation measures the maximum number of clauses in a CSP instance which can be logically independen…