1 paper
Ke Xu, Guangyan Zhou
In this paper, by constructing extremely hard examples of CSP (with large domains) and SAT (with long clauses), we prove that such examples cannot be solved without exhaustive sear…