Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > STREAMING INAPPROXIMABILITY:
Reports tagged with streaming inapproximability:
TR25-148 | 12th October 2025
Noah Singer

Nine lower bound conjectures on streaming approximation algorithms for CSPs

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.

more >>>



ISSN 1433-8092 | Imprint