Error reduction for weighted PRGs against read once branching programs

Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Weighted pseudorandom generators (WPRGs), introduced by Braverman, Cohen and Garg [5], are a generalization of pseudorandom generators (PRGs) in which arbitrary real weights are considered, rather than a probability mass. Braverman et al. constructed WPRGs against read once branching programs (ROBPs) with near-optimal dependence on the error parameter. Chattopadhyay and Liao [6] somewhat simplified the technically involved BCG construction, also obtaining some improvement in parameters. In this work we devise an error reduction procedure for PRGs against ROBPs. More precisely, our procedure transforms any PRG against length n width w ROBP with error 1/poly(n) having seed length s to a WPRG with seed length s + O(log wε · log log 1ε ). By instantiating our procedure with Nisan's PRG [17] we obtain a WPRG with seed length O(log n · log(nw) + log wε · log log 1ε ). This improves upon [5] and is incomparable with [6]. Our construction is significantly simpler on the technical side and is conceptually cleaner. Another advantage of our construction is its low space complexity O(log nw) + poly(log log 1ε ) which is logarithmic in n for interesting values of the error parameter ε. Previous constructions (like [5, 6]) specify the seed length but not the space complexity, though it is plausible they can also achieve such (or close) space complexity.

Original languageEnglish
Title of host publication36th Computational Complexity Conference, CCC 2021
EditorsValentine Kabanets
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771931
DOIs
StatePublished - 1 Jul 2021
Event36th Computational Complexity Conference, CCC 2021 - Virtual, Toronto, Canada
Duration: 20 Jul 202123 Jul 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume200
ISSN (Print)1868-8969

Conference

Conference36th Computational Complexity Conference, CCC 2021
Country/TerritoryCanada
CityVirtual, Toronto
Period20/07/2123/07/21

Keywords

  • Pseudorandom generators
  • Read once branching programs
  • Space-bounded computation

Fingerprint

Dive into the research topics of 'Error reduction for weighted PRGs against read once branching programs'. Together they form a unique fingerprint.

Cite this