{"id":"https://openalex.org/W3007807100","doi":"https://doi.org/10.1137/18m1197734","title":"Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs","display_name":"Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3007807100","doi":"https://doi.org/10.1137/18m1197734","mag":"3007807100"},"language":"en","primary_location":{"id":"doi:10.1137/18m1197734","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1197734","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/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Braverman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018113933","display_name":"Gil Cohen","orcid":"https://orcid.org/0000-0002-1173-0338"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gil Cohen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051447099","display_name":"Sumegha Garg","orcid":"https://orcid.org/0000-0002-8069-6655"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sumegha Garg","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":0.6907,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75152174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"49","issue":"5","first_page":"STOC18","last_page":"242"},"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.9998999834060669,"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.9998999834060669,"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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.8551008701324463},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.6911147236824036},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6655060648918152},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6545853614807129},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.653278112411499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6307031512260437},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.4663834571838379},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43132662773132324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25127989053726196},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1832682192325592},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.06702321767807007}],"concepts":[{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.8551008701324463},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.6911147236824036},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6655060648918152},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6545853614807129},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.653278112411499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6307031512260437},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.4663834571838379},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43132662773132324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25127989053726196},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1832682192325592},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06702321767807007},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1197734","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1197734","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2331278181","display_name":null,"funder_award_id":"CCF-1525342","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226981347","display_name":null,"funder_award_id":"CCF-1149888","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G647586973","display_name":null,"funder_award_id":"DMS-1128155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W90947819","https://openalex.org/W98427509","https://openalex.org/W198177064","https://openalex.org/W1485383051","https://openalex.org/W1488557728","https://openalex.org/W1527197079","https://openalex.org/W1540485574","https://openalex.org/W1608628057","https://openalex.org/W1652911975","https://openalex.org/W1982129592","https://openalex.org/W1985314294","https://openalex.org/W1988618382","https://openalex.org/W1995273909","https://openalex.org/W1998918799","https://openalex.org/W2002887716","https://openalex.org/W2006007166","https://openalex.org/W2011438986","https://openalex.org/W2026036943","https://openalex.org/W2049516232","https://openalex.org/W2056352038","https://openalex.org/W2060474153","https://openalex.org/W2062861676","https://openalex.org/W2073445540","https://openalex.org/W2099601775","https://openalex.org/W2106110343","https://openalex.org/W2108347494","https://openalex.org/W2131115830","https://openalex.org/W2136616826","https://openalex.org/W2141149699","https://openalex.org/W2158747250","https://openalex.org/W2337498233","https://openalex.org/W2395271957","https://openalex.org/W2561287843","https://openalex.org/W2610183793","https://openalex.org/W2611754984","https://openalex.org/W2950921924","https://openalex.org/W4205550388"],"related_works":["https://openalex.org/W4242117757","https://openalex.org/W1576065320","https://openalex.org/W3197588836","https://openalex.org/W2015880590","https://openalex.org/W1513039030","https://openalex.org/W2553569605","https://openalex.org/W2792338823","https://openalex.org/W3037248839","https://openalex.org/W2024824006","https://openalex.org/W1524332342"],"abstract_inverted_index":{"Nisan":[0],"[Combinatorica,":[1],"12":[2],"(1992),":[3],"pp.":[4,173],"449--461]":[5],"constructed":[6],"a":[7,67,119,206,218,245],"pseudorandom":[8,90,177,213,221],"generator":[9,91],"for":[10,80,102,113,182,196,251],"length":[11,24,124,183],"$n$,":[12,132,184],"width":[13,185],"$n$":[14],"read-once":[15],"branching":[16],"programs":[17],"(ROBPs)":[18],"with":[19,122,179,238],"error":[20,180,260],"$\\varepsilon$":[21,130],"and":[22,61,131,133,165,204,229],"seed":[23,40,123],"$O(\\log^2{n}":[25],"+":[26],"\\log{n}":[27],"\\cdot":[28],"\\log(1/\\varepsilon))$.":[29],"A":[30],"major":[31],"goal":[32],"in":[33,72,144,193,223],"complexity":[34],"theory":[35],"is":[36,87,157,217],"to":[37,43,48,66,94,232,236,257],"reduce":[38],"the":[39,44,88,98,110,114,138,161],"length,":[41],"hopefully,":[42],"optimal":[45],"$O(\\log{n}+\\log(1/\\varepsilon))$,":[46],"or":[47],"construct":[49,205],"improved":[50],"hitting":[51,100,120,248],"sets,":[52],"as":[53,234],"these":[54],"would":[55],"yield":[56],"stronger":[57],"derandomization":[58,252],"of":[59,70,142,163,209,220],"${BPL}$":[60],"${RL}$,":[62],"respectively.":[63],"In":[64,105,200],"contrast":[65],"successful":[68],"line":[69],"work":[71,162],"restricted":[73],"settings,":[74],"no":[75],"progress":[76],"has":[77],"been":[78],"made":[79],"general,":[81],"unrestricted,":[82],"ROBPs.":[83,104],"Indeed,":[84],"Nisan's":[85],"construction":[86,147],"best":[89,99],"and,":[92,250],"prior":[93,151],"this":[95,106,216],"work,":[96,107],"also":[97,158],"set":[101,121],"unrestricted":[103],"we":[108,128,202,211],"make":[109],"first":[111],"improvement":[112],"general":[115],"case":[116],"by":[117,160],"constructing":[118],"$\\widetilde{O}(\\log^2{n}+\\log(1/\\varepsilon))$.":[125],"That":[126],"is,":[127],"decouple":[129],"obtain":[134],"near-optimal":[135],"dependence":[136],"on":[137],"former.":[139],"The":[140],"regime":[141],"parameters":[143],"which":[145,224],"our":[146],"strictly":[148],"improves":[149],"upon":[150],"works,":[152],"namely,":[153],"$\\log(1/\\varepsilon)":[154],"\\gg":[155],"\\log{n}$,":[156],"motivated":[159],"Saks":[164],"Zhou":[166],"[J.":[167],"Comput.":[168],"System":[169],"Sci.,":[170],"58":[171],"(1999),":[172],"376--403],":[174],"who":[175],"use":[176],"generators":[178,222],"$\\varepsilon$,":[181],"$w$":[186],"ROBPs,":[187],"such":[188,244],"that":[189,243],"$w,1/\\varepsilon":[190],"=":[191],"2^{(\\log{n})^{2}}$":[192],"their":[194],"proof":[195],"${BPL}":[197],"\\subseteq":[198],"\\mathbf{L}^{3/2}$.":[199],"fact,":[201],"introduce":[203],"new":[207],"type":[208],"primitive":[210,246],"call":[212],"pseudo-distributions.":[214],"Informally,":[215],"generalization":[219],"one":[225],"may":[226],"assign":[227],"negative":[228],"unbounded":[230],"weights":[231],"paths,":[233],"opposed":[235],"working":[237],"probability":[239],"distributions.":[240],"We":[241],"show":[242],"yields":[247],"sets":[249],"purposes,":[253],"can":[254],"be":[255],"used":[256],"derandomize":[258],"two-sided":[259],"algorithms.":[261]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}