Let P:{0, 1} k→{0, 1} be a nontrivial k-ary predicate. Consider a random instance of the
constraint satisfaction problem (P) on n variables with Δ n constraints, each being P applied …

We show optimal (up to a constant factor) NP-hardness for a maximum constraint
satisfaction problem with k variables per constraint (Max-k CSP) whenever k is larger than …

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≫ n the instance will be unsatisfiable with high …

Furthering the study of cryptography in constant parallel time, we give new evidence for the
security of Gold Reich's candidate pseudorandom generator with near-optimal, polynomial …

Constant parallel-time cryptography allows to perform complex cryptographic tasks at an
ultimate level of parallelism, namely by local functions that each of their output bits depend …

Relaxations for the constraint satisfaction problem (CSP) include bounded width, linear
program (LP), semidefinite program (SDP), affine integer program (AIP), and the combined …

We prove that for every ε> 0 and predicate P:{0, 1} k->{0, 1} that supports a pairwise
independent distribution, there exists an instance I of the Max P constraint satisfaction …

We give an efficient algorithm to strongly refute semi-random instances of all Boolean
constraint satisfaction problems. The number of constraints required by our algorithm …

For a $ k $-ary predicate $ P $, a random instance of CSP $(P) $ with $ n $ variables and $
m $ constraints is unsatisfiable with high probability when $ m\gg n $. The natural …

Given a k-ary predicate P, a random instance of a constraint satisfaction problem with
predicate P (CSP (P)) is a set of m constraints on n variables. Each constraint is P applied to …