{"id":"https://openalex.org/W7148945786","doi":"https://doi.org/10.48550/arxiv.2604.01400","title":"Near-Optimal Space Lower Bounds for Streaming CSPs","display_name":"Near-Optimal Space Lower Bounds for Streaming CSPs","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148945786","doi":"https://doi.org/10.48550/arxiv.2604.01400"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01400","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01400","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.01400","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132892847","display_name":"Yumou Fei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fei, Yumou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Minzer, Dor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132861357","display_name":"Shuo Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Shuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4584999978542328,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4584999978542328,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.29249998927116394,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.09149999916553497,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7493000030517578},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6654000282287598},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5848000049591064},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5493000149726868},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5138999819755554},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5123999714851379},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4864000082015991}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7493000030517578},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6654000282287598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.635699987411499},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5848000049591064},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5493000149726868},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5138999819755554},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5123999714851379},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4864000082015991},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4429999887943268},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.43939998745918274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3955000042915344},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.38269999623298645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.357699990272522},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3400999903678894},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28769999742507935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2799000144004822},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01400","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01400","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.01400","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01400","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"a":[1,8,25,70,114],"streaming":[2,47],"constraint":[3],"satisfaction":[4],"problem":[5],"(streaming":[6],"CSP),":[7],"$p$-pass":[9],"algorithm":[10],"receives":[11],"the":[12,22,29,33,65,118,127,144,152,187,197],"constraints":[13],"of":[14,31,36,117,146,154,189,202],"an":[15,81,175],"instance":[16],"sequentially,":[17],"making":[18],"$p$":[19],"passes":[20,90],"over":[21],"input":[23],"in":[24],"fixed":[26],"order,":[27],"with":[28,133],"goal":[30],"approximating":[32],"maximum":[34],"fraction":[35],"satisfiable":[37],"constraints.":[38],"We":[39,102],"show":[40,166],"near":[41],"optimal":[42],"space":[43],"lower":[44,105,128,199],"bounds":[45],"for":[46,62,76,113],"CSPs,":[48,164],"improving":[49],"upon":[50],"prior":[51],"works.":[52],"(1)":[53],"Fei,":[54,190],"Minzer":[55,191],"and":[56,91,192,196,204],"Wang":[57,193],"(\\textit{STOC":[58,194,206],"2026})":[59,195],"showed":[60],"that":[61,139,167,173],"any":[63,77],"CSP,":[64],"basic":[66],"linear":[67],"program":[68],"defines":[69],"threshold":[71],"$\u03b1_{\\mathrm{LP}}\\in":[72],"[0,1]$":[73],"such":[74,172],"that,":[75],"$\\varepsilon":[78],">":[79],"0$,":[80],"$(\u03b1_{\\mathrm{LP}}":[82,96],"-":[83],"\\varepsilon)$-approximation":[84,98],"can":[85],"be":[86],"achieved":[87],"using":[88],"constant":[89],"polylogarithmic":[92],"space,":[93],"whereas":[94],"achieving":[95,174],"+":[97],"requires":[99,177],"$\u03a9(n^{1/3}/p)$":[100],"space.":[101,179],"improve":[103],"this":[104,137],"bound":[106,129,200],"to":[107,130],"$\u03a9(\\sqrt{n}/p)$,":[108],"which":[109],"is":[110,141],"nearly":[111],"tight":[112],"gap":[115],"version":[116],"problem.":[119],"(2)":[120],"For":[121,162],"$p=o(\\log":[122],"n)$,":[123],"we":[124,165],"further":[125],"strengthen":[126],"$\u03a9(n\\cdot2^{-O_{\\varepsilon}(p)})$.":[131],"Combined":[132],"existing":[134],"algorithmic":[135],"results,":[136],"shows":[138],"$\u03b1_{\\mathrm{LP}}$":[140],"not":[142],"only":[143],"limit":[145,153],"multi-pass":[147],"polylogarithmic-space":[148],"algorithms,":[149],"but":[150],"also":[151],"single-pass":[155],"sublinear-space":[156],"algorithms":[157],"on":[158,186],"bounded-degree":[159],"instances.":[160],"(3)":[161],"certain":[163],"there":[168],"exists":[169],"$\u03b1<":[170],"1$":[171],"$\u03b1$-approximation":[176],"$\u03a9(n/p)$":[178],"Our":[180],"proofs":[181],"are":[182],"Fourier":[183],"analytic,":[184],"building":[185],"techniques":[188],"Fourier-$\\ell_1$-based":[198],"method":[201],"Kapralov":[203],"Krachun":[205],"2019}).":[207]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-04T00:00:00"}