Recursive Error Reduction for Regular Branching Programs

by   Eshan Chattopadhyay, et al.

In a recent work, Chen, Hoza, Lyu, Tal and Wu (FOCS 2023) showed an improved error reduction framework for the derandomization of regular read-once branching programs (ROBPs). Their result is based on a clever modification to the inverse Laplacian perspective of space-bounded derandomization, which was originally introduced by Ahmadinejad, Kelner, Murtagh, Peebles, Sidford and Vadhan (FOCS 2020). In this work, we give an alternative error reduction framework for regular ROBPs. Our new framework is based on a binary recursive formula from the work of Chattopadhyay and Liao (CCC 2020), that they used to construct weighted pseudorandom generators (WPRGs) for general ROBPs. Based on our new error reduction framework, we give alternative proofs to the following results for regular ROBPs of length n and width w, both of which were proved in the work of Chen et al. using their error reduction: ∙ There is a WPRG with error ε that has seed length Õ(log(n)(√(log(1/ε))+log(w))+log(1/ε)). ∙ There is a (non-black-box) deterministic algorithm which estimates the expectation of any such program within error ±ε with space complexity Õ(log(nw)·loglog(1/ε)). (This was first proved in the work of Ahmadinejad et al., but the proof by Chen et al. is simpler.) Because of the binary recursive nature of our new framework, both of our proofs are based on a straightforward induction that is arguably simpler than the Laplacian-based proof in the work of Chen et al.


page 1

page 2

page 3

page 4


Optimal Error Pseudodistributions for Read-Once Branching Programs

In 1992, Nisan (Combinatorica'92) constructed a pseudorandom generator f...

Pseudorandom Generators for Width-3 Branching Programs

We construct pseudorandom generators of seed length Õ((n)·(1/ϵ)) that ϵ-...

Improved Pseudorandom Generators for 𝖠𝖢^0 Circuits

We show a new PRG construction fooling depth-d, size-m 𝖠𝖢^0 circuits wit...

A polynomial time construction of a hitting set for read-once branching programs of width 3

Recently, an interest in constructing pseudorandom or hitting set genera...

Faster Algorithms for Longest Common Substring

In the classic longest common substring (LCS) problem, we are given two ...

Explicit Designs and Extractors

We give significantly improved explicit constructions of three related p...

On Geodesically Convex Formulations for the Brascamp-Lieb Constant

We consider two non-convex formulations for computing the optimal consta...

Please sign up or login with your details

Forgot password? Click here to reset