Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat

@article{Chou2020OptimalSA,
  title={Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat},
  author={Chi-Ning Chou and Alexander Golovnev and Santhoshini Velusamy},
  journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2020},
  pages={330-341}
}
We prove tight upper and lower bounds on approximation ratios of all Boolean Max-2CSP problems in the streaming model. Specifically, for every type of Max-2CSP problem, we give an explicit constant $\alpha$, s.t. for any $\epsilon > 0$ (i) there is an ($\alpha-\epsilon$)-streaming approximation using space $O(\log n)$; and (ii) any ($\alpha+\epsilon$)-streaming approximation requires space $\Omega(\sqrt{n})$. This generalizes the celebrated work of [Kapralov, Khanna, Sudan SODA 2015; Kapralov… Expand
Classification of the streaming approximability of Boolean CSPs
Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma

References

SHOWING 1-10 OF 52 REFERENCES
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
Streaming Hardness of Unique Games
New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem
Streaming Lower Bounds for Approximating MAX-CUT
An optimal space lower bound for approximating MAX-CUT
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space
Every 2-csp Allows Nontrivial Approximation
  • J. Håstad
  • Mathematics, Computer Science
  • computational complexity
  • 2008
Optimal algorithms and inapproximability results for every CSP?
Towards Sharp Inapproximability For Any 2-CSP
  • Per Austrin
  • Mathematics, Computer Science
  • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
...
1
2
3
4
5
...