Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products

Daya Gaur, Muhammad Khan

We study the design of stochastic local search methods to prove unsatisfiability of a constraint satisfaction problem (CSP). For a binary CSP, such methods have been designed using…