{"id":"https://openalex.org/W7118807048","doi":"https://doi.org/10.1137/1.9781611978971.124","title":"Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions","display_name":"Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118807048","doi":"https://doi.org/10.1137/1.9781611978971.124"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.124","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.124","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"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/A5014279694","display_name":"Kuan Cheng","orcid":"https://orcid.org/0000-0002-8972-1749"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kuan Cheng","raw_affiliation_strings":["Peking University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peking University","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020344608","display_name":"Ruiyang Wu","orcid":"https://orcid.org/0000-0001-7417-9507"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruiyang Wu","raw_affiliation_strings":["Peking University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Peking University","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20231570"],"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":"3423","last_page":"3458"},"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.7627000212669373,"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.7627000212669373,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.028699999675154686,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.02160000056028366,"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/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.7896999716758728},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.593500018119812},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.5547000169754028},{"id":"https://openalex.org/keywords/random-permutation","display_name":"Random permutation","score":0.5343999862670898},{"id":"https://openalex.org/keywords/random-seed","display_name":"Random seed","score":0.40130001306533813},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.39640000462532043},{"id":"https://openalex.org/keywords/length-measurement","display_name":"Length measurement","score":0.33180001378059387}],"concepts":[{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.7896999716758728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7602999806404114},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.593500018119812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5681999921798706},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.5547000169754028},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.5343999862670898},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4805999994277954},{"id":"https://openalex.org/C26263659","wikidata":"https://www.wikidata.org/wiki/Q1886131","display_name":"Random seed","level":3,"score":0.40130001306533813},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.39640000462532043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3547999858856201},{"id":"https://openalex.org/C21353171","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Length measurement","level":2,"score":0.33180001378059387},{"id":"https://openalex.org/C3019641298","wikidata":"https://www.wikidata.org/wiki/Q625642","display_name":"Word length","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C25818197","wikidata":"https://www.wikidata.org/wiki/Q7255477","display_name":"Pseudorandom permutation","level":4,"score":0.28600001335144043},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2822999954223633}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.124","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.124","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,26],"study":[1],"weighted":[2,371],"pseudorandom":[3,372],"generators":[4],"(WPRGs)":[5],"and":[6,15,20,82,90,138,148,181,237,330],"derandomizations":[7],"for":[8,106,199,232,257,335],"read-once":[9],"branching":[10],"programs":[11],"(ROBPs).":[12],"Denote":[13],"\\(n\\)":[14],"\\(w\\)":[16],"as":[17],"the":[18,21,28,76,83,131,174,291,297,322,345,354],"length":[19,41,111,159,198,229],"width":[22],"of":[23,78,85,133,176,324],"an":[24,36,154],"ROBP.":[25],"have":[27],"following":[29],"results.":[30],"For":[31,142,266],"standard":[32,215,360],"ROBPs,":[33],"there":[34],"exists":[35],"explicit":[37,155],"\\(\\varepsilon\\)-WPRG":[38,156],"with":[39,109,145,157,195,202,220,226,269],"seed":[40,110,158,197,228,247],"\\(O\\left(\\frac{\\log":[42],"n":[43,114,123,162,166],"\\log(nw)}{\\max\\{1,\\log":[44],"\\log":[45,48,49,52,55,56,57,60,61,113,118,121,122,161,164,165],"w":[46,53,58,119],"-":[47,59],"n\\}}":[50],"+":[51,66,117,120,125,167,170],"\\left(":[54,115,163],"\\max\\left\\{2,\\frac{\\log":[62],"w}{\\log":[63],"n/\\varepsilon}\\right\\}":[64],"\\right)":[65,124,169],"\\log(1/\\varepsilon)\\right)\\).":[67],"When":[68,289],"\\(n":[69,233,258,270,311,336],"=":[70,234,259,263,275,312,316,337],"w^{o(1)}\\),":[71],"this":[72,97,222],"is":[73,188,301],"better":[74],"than":[75],"construction":[77,84],"Hoza":[79],"(RANDOM":[80],"2022),":[81],"Cohen,":[86],"Doron,":[87],"Renard,":[88],"Sberlo,":[89],"Ta-Shma":[91],"(CCC":[92],"2021).":[93],"Further,":[94],"by":[95,217,303],"using":[96],"in":[98,213,286,295,362],"a":[99,104,193,214,224,279],"black-box":[100],"way,":[101],"we":[102,152,277],"attain":[103],"WPRG":[105,194,225],"regular":[107,267],"ROBPs":[108,144,201,268,380],"\\(O\\left(":[112,160],"\\sqrt{\\log(1/\\varepsilon)}":[116,168],"\\log(1/\\varepsilon)":[126,171],"\\right)\\),":[127,172],"which":[128,253,307,374],"slightly":[129],"improves":[130,344,353],"result":[132,175,191,300,323],"Chen,":[134,177],"Hoza,":[135,178],"Lyu,":[136,179],"Tal,":[137,180],"Wu":[139,182],"(FOCS":[140,183,332],"2023).":[141,184],"permutation":[143],"unbounded":[146],"widths":[147],"single":[149],"accept":[150,204,211],"nodes,":[151],"give":[153,278],"improving":[173],"A":[185],"key":[186],"difference":[187],"that":[189],"our":[190,340,365],"implies":[192],"optimal":[196,227,246,256],"short-wide":[200],"multiple":[203,210],"nodes.":[205],"Specifically,":[206],"after":[207],"switching":[208],"to":[209,293,321,348,359,381],"nodes":[212],"way":[216],"replacing":[218],"\\(\\varepsilon\\)":[219],"\\(\\varepsilon/w\\),":[221],"gives":[223],"\\(O(\\log":[230,283],"w)\\)":[231],"2^{O(\\sqrt{\\log":[235,272,338],"w})}\\),":[236,273],"error":[238],"\\(1/\\operatorname{poly}":[239],"w\\).":[240],"The":[241],"only":[242,255,298,309,343],"previous":[243,299],"work":[244],"attaining":[245],"lengths":[248],"are":[249,254,367],"Nisan-Zuckerman":[250,304],"style":[251,305],"PRGs":[252],"\\operatorname{poly}\\log":[260,313],"w\\),":[261,314],"\\(\\varepsilon":[262,274,315],"2^{-\\log^{0.9}":[264,317],"w}\\).":[265,318],"\\le":[271],"1/\\operatorname{poly}(w)\\),":[276],"derandomization":[280,292,341],"within":[281],"space":[282,346],"w)\\),":[284],"i.e.,":[285],"\\(\\mathbf{L}\\)":[287],"exactly.":[288],"requiring":[290],"be":[294],"\\(\\mathbf{L}\\),":[296],"again":[302],"PRGs,":[306],"can":[308,375],"handle":[310],"If":[319],"compared":[320],"Ahmadinejad,":[325],"Kelner,":[326],"Murtagh,":[327],"Peebles,":[328],"Sidford,":[329],"Vadhan":[331],"2020),":[333],"then":[334],"w})}\\)":[339],"not":[342],"complexity":[347,356],"optimal,":[349],"but":[350],"also":[351],"substantially":[352],"time":[355],"from":[357],"super-polynomial":[358],"polynomial":[361],"\\(w\\).":[363],"All":[364],"results":[366],"based":[368],"on":[369],"iterative":[370],"reductions,":[373],"iteratively":[376],"reduce":[377],"fooling":[378,382],"long":[379],"short":[383],"ones.":[384]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-08T00:00:00"}