{"id":"https://openalex.org/W7128625657","doi":"https://doi.org/10.1109/focs63196.2025.00081","title":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","display_name":"Multi-Pass Streaming Lower Bounds for Approximating Max-Cut","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128625657","doi":"https://doi.org/10.1109/focs63196.2025.00081"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023771090","display_name":"Yumou Fei","orcid":"https://orcid.org/0000-0003-3093-8975"},"institutions":[{"id":"https://openalex.org/I126820664","display_name":"Vassar College","ror":"https://ror.org/022x6qg61","country_code":"US","type":"education","lineage":["https://openalex.org/I126820664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yumou Fei","raw_affiliation_strings":["CSAIL MIT,Cambridge,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSAIL MIT,Cambridge,USA","institution_ids":["https://openalex.org/I126820664"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dor Minzer","raw_affiliation_strings":["Department of Mathematics MIT,Cambridge,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5125654993","display_name":"Shuo Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shuo Wang","raw_affiliation_strings":["Department of Mathematics MIT,Cambridge,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70057941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1537","last_page":"1560"},"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.8234000205993652,"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.8234000205993652,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.05119999870657921,"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/T10237","display_name":"Cryptography and Data Security","score":0.027499999850988388,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/streaming-algorithm","display_name":"Streaming algorithm","score":0.8047000169754028},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.652999997138977},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5123000144958496},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4851999878883362},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4715999960899353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4447999894618988},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.40149998664855957},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37220001220703125}],"concepts":[{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.8047000169754028},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.652999997138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5939000248908997},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4851999878883362},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4715999960899353},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4494999945163727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4447999894618988},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43720000982284546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4108999967575073},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.40149998664855957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3427000045776367},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.2655999958515167},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00081","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"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],"the":[1,5,12,30,33,80,84,88,185,191,195,216,233,261,274,280,296],"Max-Cut":[2,141,168],"problem":[3],"in":[4,20,36,82,279],"streaming":[6,63,162],"model,":[7],"an":[8,15,40],"algorithm":[9,64,85,139,166,196],"is":[10,27,273],"given":[11],"edges":[13],"of":[14,32,43,194,197,232,241,263,295],"unknown":[16],"graph":[17],"$G=(V,":[18],"E)$":[19],"some":[21],"fixed":[22],"order,":[23],"and":[24,46,53,91,109,121,226,245,282,289],"its":[25],"goal":[26],"to":[28,107,179],"approximate":[29],"size":[31],"largest":[34],"cut":[35],"G.":[37],"Improving":[38],"upon":[39,130],"earlier":[41],"result":[42,74,102,177],"Kapralov,":[44],"Khanna":[45],"Sudan,":[47,200],"it":[48,92],"was":[49,93],"shown":[50],"by":[51,208,224],"Kapralov":[52,225],"Krachun":[54],"that":[55,135,155,247],"for":[56,71,76,124,140,156,167,184,215,251,300],"all":[57,157],"$\\varepsilon\\gt":[58,158],"0$,":[59,159],"no":[60],"$o(n)$":[61],"memory":[62],"can":[65,253],"achieve":[66],"a":[67,160,180,210,229,239,257,264],"$(1":[68,163],"/":[69,164,171,173],"2+\\varepsilon)$-approximation":[70,165],"Max-Cut.":[72],"Their":[73],"holds":[75],"single-pass":[77],"streams,":[78],"i.e.":[79],"setting":[81],"which":[83],"only":[86],"views":[87],"stream":[89],"once,":[90],"open":[94],"whether":[95],"multi-pass":[96],"access":[97],"may":[98],"help.":[99],"The":[100,270],"state-of-the-art":[101,132],"along":[103],"these":[104],"lines,":[105],"due":[106],"Assadi":[108],"N,":[110],"rules":[111],"out":[112],"arbitrarily":[113],"good":[114],"approximation":[115,138],"algorithms":[116],"with":[117],"constantly":[118],"many":[119,145],"passes":[120,146],"$n^{1-\\delta}$":[122],"space":[123],"any":[125,136,249],"$\\delta\\gt":[126],"0$.":[127],"We":[128],"improve":[129],"this":[131],"result,":[133],"showing":[134,190,209],"non-trivial":[137],"requires":[142,169],"either":[143],"polynomially":[144,148],"or":[147],"large":[149],"space.":[150,175],"More":[151],"specifically,":[152],"we":[153,237,284],"show":[154,246],"k-pass":[161],"$\\Omega_{\\varepsilon}\\left(n^{1":[170],"3}":[172],"k\\right)$":[174],"This":[176],"leads":[178],"similar":[181],"lower":[182,205,213],"bound":[183,214],"Maximum":[186],"Directed":[187],"Cut":[188],"problem,":[189],"near":[192],"optimality":[193],"[Saxena,":[198],"Singer,":[199],"Velusamy,":[201],"SODA":[202],"2025].":[203],"Our":[204],"bounds":[206],"proceed":[207],"communication":[211],"complexity":[212],"Distributional":[217],"Implicit":[218],"Hidden":[219],"Partition":[220],"(DIHP)":[221],"Problem,":[222],"introduced":[223],"Krachun.":[227],"While":[228],"naive":[230],"application":[231],"discrepancy":[234,262],"method":[235],"fails,":[236],"identify":[238],"property":[240],"protocols":[242],"called":[243],"\u201cglobalness\u201d,":[244],"(1)":[248],"protocol":[250,266],"DIHP":[252],"be":[254,268],"turned":[255],"into":[256],"global":[258,265,286,301],"protocol,":[259],"(2)":[260],"must":[267],"small.":[269],"second":[271],"step":[272,278],"more":[275,290],"technically":[276],"involved":[277],"argument,":[281],"therein":[283],"use":[285],"hypercontractive":[287],"inequalities,":[288],"specifically":[291],"strong":[292],"quantitative":[293],"versions":[294],"level-":[297],"d":[298],"inequality":[299],"functions.":[302]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-12T00:00:00"}