{"id":"https://openalex.org/W358628003","doi":"https://doi.org/10.1137/060654645","title":"Lower Bounds for Lov\u00e1sz\u2013Schrijver Systems and Beyond Follow from Multiparty Communication Complexity","display_name":"Lower Bounds for Lov\u00e1sz\u2013Schrijver Systems and Beyond Follow from Multiparty Communication Complexity","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W358628003","doi":"https://doi.org/10.1137/060654645","mag":"358628003"},"language":"en","primary_location":{"id":"doi:10.1137/060654645","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060654645","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Beame","raw_affiliation_strings":["Computer Science and Engineering, University of Washington, Seattle"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Washington, Seattle","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["CA","FR"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["Computer Science Department, University of Toronto, Toronto,"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Toronto, Toronto,","institution_ids":["https://openalex.org/I4210156583","https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039320961","display_name":"Nathan Segerlind","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Segerlind","raw_affiliation_strings":["Computer Science and Engineering, University of Washington, Seattle"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, University of Washington, Seattle","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042076941"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02592608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"3","first_page":"845","last_page":"869"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.8062610626220703},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7655262351036072},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7502181529998779},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6554499268531799},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5645329356193542},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4787016212940216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45456862449645996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42911791801452637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2691565454006195},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.16489973664283752},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.06458467245101929}],"concepts":[{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.8062610626220703},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7655262351036072},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7502181529998779},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6554499268531799},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5645329356193542},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4787016212940216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45456862449645996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42911791801452637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2691565454006195},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16489973664283752},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06458467245101929},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/060654645","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060654645","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.118.6775","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.6775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.cecs.pdx.edu/~nsegerli/publications/treeLSviaCC.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.143.3770","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.3770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/beame/papers/kfoldtseitin.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.997","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.997","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/beame/papers/kfoldtseitin-journal.pdf","raw_type":"text"},{"id":"mag:358628003","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W152703237","https://openalex.org/W153015188","https://openalex.org/W215161086","https://openalex.org/W281465961","https://openalex.org/W1499875748","https://openalex.org/W1567053297","https://openalex.org/W1587123489","https://openalex.org/W1893254807","https://openalex.org/W1966278576","https://openalex.org/W1972068724","https://openalex.org/W1980223785","https://openalex.org/W1996256832","https://openalex.org/W1999069928","https://openalex.org/W2011805810","https://openalex.org/W2038193643","https://openalex.org/W2044095368","https://openalex.org/W2049143039","https://openalex.org/W2057512592","https://openalex.org/W2079401865","https://openalex.org/W2099246938","https://openalex.org/W2106264302","https://openalex.org/W2113462655","https://openalex.org/W2120210041","https://openalex.org/W2133392939","https://openalex.org/W2139128805","https://openalex.org/W2145243417","https://openalex.org/W2158029166","https://openalex.org/W2340787257","https://openalex.org/W2492280620","https://openalex.org/W2611147814","https://openalex.org/W2798588639","https://openalex.org/W4235946010"],"related_works":["https://openalex.org/W2272066300","https://openalex.org/W2402254081","https://openalex.org/W2949083013","https://openalex.org/W2172507717","https://openalex.org/W2403908979","https://openalex.org/W3186935454","https://openalex.org/W2015924804","https://openalex.org/W1569763258","https://openalex.org/W1823715352","https://openalex.org/W2953159218","https://openalex.org/W3213681675","https://openalex.org/W2953323745","https://openalex.org/W1500625764","https://openalex.org/W2142777206","https://openalex.org/W3105094916","https://openalex.org/W2952978069","https://openalex.org/W3099921078","https://openalex.org/W2152772468","https://openalex.org/W2913304003","https://openalex.org/W2949214562"],"abstract_inverted_index":{"We":[0],"prove":[1,41],"that":[2,29,42],"an":[3,20,43],"$\\omega(\\log^4":[4],"n)$":[5],"lower":[6,23,45,60],"bound":[7,24,46,61],"for":[8,25,47,62],"the":[9,16,48],"three-party":[10],"number-on-the-forehead":[11],"(NOF)":[12],"communication":[13,51],"complexity":[14,52],"of":[15,53],"set-disjointness":[17],"function":[18],"implies":[19,56],"$n^{\\omega(1)}$":[21],"size":[22,59],"treelike":[26,64],"Lov\u00e1sz\u2013Schrijver":[27],"systems":[28,66],"refute":[30],"unsatisfiable":[31],"formulas":[32,68],"in":[33],"conjunctive":[34],"normal":[35],"form":[36],"(CNFs).":[37],"More":[38],"generally,":[39],"we":[40],"$n^{\\Omega(1)}$":[44],"$(k+1)$-party":[49],"NOF":[50],"set":[54],"disjointness":[55],"a":[57],"$2^{n^{\\Omega(1)}}$":[58],"all":[63],"proof":[65],"whose":[67],"are":[69],"degree":[70],"k":[71],"polynomial":[72],"inequalities.":[73]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}