{"id":"https://openalex.org/W2926912675","doi":"https://doi.org/10.1145/3313232","title":"Lower bounds for Sum and Sum of Products of Read-once Formulas","display_name":"Lower bounds for Sum and Sum of Products of Read-once Formulas","publication_year":2019,"publication_date":"2019-04-02","ids":{"openalex":"https://openalex.org/W2926912675","doi":"https://doi.org/10.1145/3313232","mag":"2926912675"},"language":"en","primary_location":{"id":"doi:10.1145/3313232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313232","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5019965402","display_name":"C. Ramya","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"C. Ramya","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, Tamil Nadu, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110296299","display_name":"B. V. Raghavendra Rao","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. V. Raghavendra Rao","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, Tamil Nadu, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019965402"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.6064,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69641535,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"2","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T10237","display_name":"Cryptography and Data Security","score":0.9993000030517578,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7473412156105042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7320835590362549},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6326878070831299},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6128612160682678},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5694088935852051},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5224653482437134},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5154877305030823},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4375334084033966},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0992460548877716}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7473412156105042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7320835590362549},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6326878070831299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6128612160682678},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5694088935852051},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5224653482437134},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5154877305030823},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4375334084033966},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0992460548877716}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3313232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3313232","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1508771701","https://openalex.org/W1544226152","https://openalex.org/W1570807665","https://openalex.org/W1576854535","https://openalex.org/W1964748897","https://openalex.org/W1973342538","https://openalex.org/W1988938797","https://openalex.org/W1989274820","https://openalex.org/W1992071680","https://openalex.org/W2016576580","https://openalex.org/W2023541349","https://openalex.org/W2027044307","https://openalex.org/W2046919433","https://openalex.org/W2055425281","https://openalex.org/W2079910744","https://openalex.org/W2093103267","https://openalex.org/W2128510017","https://openalex.org/W2142326730","https://openalex.org/W2170831059","https://openalex.org/W2171403864","https://openalex.org/W2172394696","https://openalex.org/W2181660280","https://openalex.org/W2405684937","https://openalex.org/W2766274873","https://openalex.org/W2914183794","https://openalex.org/W4233121052"],"related_works":["https://openalex.org/W1998402272","https://openalex.org/W2613624679","https://openalex.org/W2060058676","https://openalex.org/W1988552935","https://openalex.org/W2919290453","https://openalex.org/W4362554012","https://openalex.org/W2108149667","https://openalex.org/W2283239302","https://openalex.org/W2963873487","https://openalex.org/W2574373534"],"abstract_inverted_index":{"We":[0,17,46,142],"study":[1],"limitations":[2],"of":[3,29,58,71,77,97,110,130,134,174,196,235],"polynomials":[4],"computed":[5],"by":[6,40,117,223,255],"depth-2":[7],"circuits":[8,66,181,192],"built":[9,67,182,218],"over":[10,68,183],"read-once":[11],"formulas":[12,133],"(ROFs).":[13],"In":[14],"particular:":[15],"\u2022":[16,45,141,158],"prove":[18],"a":[19,48,103,106,128,154,194,232],"2":[20,33,49],"\u03a9(":[21],"n":[22,34,51,62,79,81,119],")":[23,52],"lower":[24,53,125,147,169,251],"bound":[25,54,87,126,148,170,210,252],"for":[26,127,149],"the":[27,32,56,75,89,95,111,138,150,163,172,205,212,220,250],"sum":[28],"ROFs":[30,70,236],"computing":[31,74,137,193],"-variate":[35],"polynomial":[36,155],"in":[37,105,156],"VP":[38],"defined":[39],"Raz":[41,256],"and":[42,228,245],"Yehudayoff":[43],"[21].":[44],"obtain":[47],"\u03a9(\u221a":[50],"on":[55,84,88,171,201,207,211,219,231],"size":[57,173],"\u03a3":[59],"\u03a0":[60],"[":[61,176,187],"1/15":[63],"]":[64,179,190],"arithmetic":[65,180,191],"restricted":[69],"unbounded":[72,135],"depth":[73,136],"permanent":[76,139],"an":[78,123,145,167],"\u00d7":[80],"matrix":[82],"(superscripts":[83],"gates":[85,101,208],"denote":[86,209],"fan-in).":[90],"The":[91],"restriction":[92],"is":[93],"that":[94,162],"number":[96],"variables":[98],"with":[99],"+":[100],"as":[102],"parent":[104],"proper":[107],"sub":[108],"formula":[109],"ROF":[112],"has":[113],"to":[114],"be":[115],"bounded":[116],"\u221a":[118],".":[120],"This":[121],"proves":[122],"exponential":[124,146,168],"subclass":[129],"possibly":[131],"non-multilinear":[132],"polynomial.":[140],"also":[143],"show":[144],"above":[151],"model":[152],"against":[153],"VP.":[157],"Finally,":[159],"we":[160],"observe":[161],"techniques":[164,216,253],"developed":[165,222],"yield":[166],"\u03a3\u03a0":[175],"N":[177,188,202],"1/30":[178],"syntactically":[184],"multi-linear":[185],"\u03a3\u03a0\u03a3":[186],"1/4":[189],"product":[195],"variable":[197],"disjoint":[198],"linear":[199],"forms":[200],"variables,":[203],"where":[204],"superscripts":[206],"fan-in.":[213],"Our":[214],"proof":[215],"are":[217,229],"measure":[221],"Kumar":[224],"et":[225],"al.":[226],"[14]":[227],"based":[230],"non-trivial":[233],"analysis":[234],"under":[237],"random":[238],"partitions.":[239],"Further,":[240],"our":[241],"results":[242],"exhibit":[243],"strengths":[244],"provide":[246],"more":[247],"insight":[248],"into":[249],"introduced":[254],"[19].":[257]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}