7 citations · 17 across the 12 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.CC2025
Nine lower bound conjectures on streaming approximation algorithms for CSPs
Noah G. Singer
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…
cs.CC2025
Sketching approximations and LP approximations for finite CSPs are related
Noah G. Singer, Madhur Tulsiani, Santhoshini Velusamy
We identify a connection between the approximability of CSPs in two models: (i) sublinear space streaming algorithms, and (ii) the basic LP relaxation. We show that whenever the ba…