Nine lower bound conjectures on streaming approximation algorithms for CSPs
By: Noah G. Singer
Potential Business Impact:
Helps computers solve hard puzzles with less memory.
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.
Similar Papers
Sketching approximations and LP approximations for finite CSPs are related
Computational Complexity
Finds patterns in data using less computer memory.
A Dichotomy Theorem for Multi-Pass Streaming CSPs
Computational Complexity
Makes computers solve tough problems with less memory.
Lower Bounds for CSP Hierarchies Through Ideal Reduction
Computational Complexity
Proves how hard some math problems are.