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 and sketching models of computation. After surveying some of the results we give some sketches of the proofs and in particular try to explain why there is a tight dichotomy result for sketching algorithms working in subpolynomial space regime.
@article{arxiv.2205.02744,
title = {Streaming and Sketching Complexity of CSPs: A survey},
author = {Madhu Sudan},
journal= {arXiv preprint arXiv:2205.02744},
year = {2022}
}