๐ฎ
๐ฎ
The Ethereal
Nine lower bound conjectures on streaming approximation algorithms for CSPs
October 12, 2025 ยท The Ethereal ยท ๐ Sigact News
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Noah G. Singer
arXiv ID
2510.10714
Category
cs.CC: Computational Complexity
Cross-listed
cs.DS
Citations
0
Venue
Sigact News
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Computational Complexity
๐ฎ
๐ฎ
The Ethereal
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
๐ฎ
๐ฎ
The Ethereal
The Parallelism Tradeoff: Limitations of Log-Precision Transformers
๐ฎ
๐ฎ
The Ethereal
The Hardness of Approximation of Euclidean k-means
๐ฎ
๐ฎ
The Ethereal
Slightly Superexponential Parameterized Problems
๐ฎ
๐ฎ
The Ethereal