Let P be a k-ary predicate over a finite alphabet. Consider a random CSP(P) instance I over n variables with m constraints. When m \gg n the instance I will be unsatisfiable with high probability, and we want to find a refutation - i.e., a certificate of unsatisfiability.
May 17, 2015
Abstract. Let P be a k-ary predicate over a finite alphabet. Consider a random CSP(P) instance I over n variables with m constraints.
Jun 28, 2015 · Abstract. Let P be a nontrivial k-ary predicate over a finite alphabet. Consider a random CSP(P) instance I over n variables with m ...
People also ask
How to solve CSP problem?
What are the common techniques for solving CSPs?
How is CSP formulated as a search problem?
Specifically, if P fails to support a t-wise uniform distribution, then there is an efficient algorithm that refutes random CSP(P) instances whp when m ≫ nt/2.
Weakly refuting k -XOR is actually easy – treating a k -XOR instance as a set of linear equations over F 2 , you can use Gaussian elimination to check if there ...
Oct 17, 2015 · Let P be a k-ary predicate over a finite alphabet. Consider a random CSP(P) instance I over n variables with m constraints.
We give a criterion for predicates that often yields efficient refutation algorithms at much lower densities. Specifically, if $P$ fails to support a $t$-wise ...
Jan 2, 2020 · Strong refutation of random CSPs is a fundamental question in theoretical computer science that has received particular attention due to the ...
Apr 5, 2017 · How to refute a random CSP. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer. Science, pages 689–708, 2015 ...
Nov 7, 2019 · We use the technique of pseudocalibration to directly obtain extended formulation lower bounds from the planted distribution. This approach ...