Streaming complexity of CSPs with randomly ordered constraints
Streaming complexity of CSPs with randomly ordered constraints
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 $\textsf{Max-DICUT}$, for which random ordering makes a provable difference. Whereas a $4/9 \approx 0.445$ approximation of $\textsf{DICUT}$ requires $\Omega(\sqrt{n})$ space with …