{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihzcermmkg63ddnx3zluu2l7qclv5kege2pdp7lat77akjn744mbe",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mj3rq3hwv4r2"
  },
  "path": "/report/2026/054",
  "publishedAt": "2026-04-09T18:57:48.000Z",
  "site": "https://eccc.weizmann.ac.il",
  "textContent": "For an arbitrary family of predicates $\\mathcal{F} \\subseteq \\\\{0,1\\\\}^{[q]^k}$ and any $\\epsilon > 0$, we prove a single-pass, linear-space streaming lower bound against the gap promise problem of distinguishing instances of Max-CSP$({\\mathcal{F}})$ with at most $\\beta+\\epsilon$ fraction of satisfiable constraints from instances of with at least $\\gamma-\\epsilon$ fraction of satisfiable constraints, whenever Max-CSP$({\\mathcal{F}})$ admits a $(\\gamma,\\beta)$-integrality gap instance for the basic LP. This subsumes the linear-space lower bound of Chou, Golovnev, Sudan, Velingker, and Velusamy (STOC 2022), which applies only to a special subclass of CSPs with linear-algebraic structure. (Their result itself generalizes work of Kapralov and Krachun (STOC 2019) for Max-CUT.) Our approach identifies the right ``analytic'' analogues of previously-used linear-algebraic conditions; this yields substantial simplifications while capturing a much larger class of problems. Our lower bound is essentially optimal for single-pass streaming, since: (1) All CSPs admit $(1-\\epsilon)$-approximations in quasilinear space, and (2) sublinear-space streaming algorithms can simulate the LP (on bounded-degree instances), giving approximation algorithms when integrality gap instances do not exist. The starting point for our lower bound is a reduction from a \"distributional implicit hidden partition'' problem defined by Fei, Minzer, and Wang (STOC 2026) in the context of multi-pass streaming. Our result is an analogue of theirs in the single-pass setting, where we obtain a much stronger (and tight) space lower bound.",
  "title": "TR26-054 |  Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs | \n\n\tNoah Singer, \n\n\tMadhur Tulsiani, \n\n\tSanthoshini Velusamy"
}