research
∙
11/08/2022
Streaming beyond sketching for Maximum Directed Cut
We give an O(√(n))-space single-pass 0.483-approximation streaming algor...
share
research
∙
07/14/2022
Streaming complexity of CSPs with randomly ordered constraints
We initiate a study of the streaming complexity of constraint satisfacti...
research
∙
12/12/2021
Closed-form expressions for the sketching approximability of (some) symmetric Boolean CSPs
A Boolean maximum constraint satisfaction problem, Max-CSP(f), is specif...
research
∙
05/04/2021
Streaming approximation resistance of every ordering CSP
An ordering constraint satisfaction problem (OCSP) is given by a positiv...
research
∙
01/23/2021
