We consider the approximability of constraint satisfaction problems in the streaming setting.
For every constraint satisfaction problem (CSP) on n variables taking values in {0,…, q− 1} …

Motivated by recent works on streaming algorithms for constraint satisfaction problems
(CSPs), we define and analyze oblivious algorithms for the Max-$ k $ AND problem. This …

We initiate a study of the streaming complexity of constraint satisfaction problems (CSPs)
when the constraints arrive in a random order. We show that there exists a CSP, namely Max …

A constraint satisfaction problem (CSP), Max-CSP(F), is specified by a finite set of
constraints F⊆{q^k→{0,1\}\} for positive integers q and k. An instance of the problem on n …

An ordering constraint satisfaction problem (OCSP) is defined by a family $\mathcal {F} $ of
predicates mapping permutations on $\{1,\ldots, k\} $ to $\{0, 1\} $. An instance of Max-OCSP …

In this survey we describe progress over the last decade or so in understanding the
complexity of solving constraint satisfaction problems (CSPs) approximately in the streaming …

A constraint satisfaction problem (CSP),, is specified by a finite set of constraints for positive
integers q and k. An instance of the problem on n variables is given by m applications of …

In this work we consider the approximability of $\textsf {Max-CSP}(f) $ in the context of
sketching algorithms and completely characterize the approximability of all Boolean CSPs …

A Boolean maximum constraint satisfaction problem, Max-CSP ($ f $), is specified by a
predicate $ f:\{-1, 1\}^ k\to\{0, 1\} $. An $ n $-variable instance of Max-CSP ($ f $) consists of a …

The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky
et. al.[STOC'07], has played an important role in the streaming lower bounds for graph …