The Richness of CSP Non-redundancy

Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen +2

In the field of constraint satisfaction problems (CSP), a clause is called redundant if its satisfaction is implied by satisfying all other clauses. An instance of CSP$(P)$ is call…