Nine lower bound conjectures on streaming approximation algorithms for CSPs
Computational Complexity
2025-10-14 v1 Data Structures and Algorithms
Abstract
In this column, we overview recent progress by many authors on understanding the approximability of constraint satisfaction problems (CSPs) in low-space streaming models. Inspired by this recent progress, we collate nine conjectural lower bounds against streaming algorithms for CSPs, some of which appear here for the first time.
Cite
@article{arxiv.2510.10714,
title = {Nine lower bound conjectures on streaming approximation algorithms for CSPs},
author = {Noah G. Singer},
journal= {arXiv preprint arXiv:2510.10714},
year = {2025}
}
Comments
12 pages, to appear in SIGACT News Open Problems column