This is a survey of unconditional pseudorandom generators (PRGs). A PRG uses a short,
truly random seed to generate a long," pseudorandom" sequence of bits. To be more …

Is randomness ever necessary for space-efficient computation? It is commonly conjectured
that L= BPL, meaning that halting decision algorithms can always be derandomized without …

We propose a new framework for constructing pseudorandom generators for n-variate
Boolean functions. It is based on two new notions. First, we introduce fractional …

We construct pseudorandom generators of seed length Õ (log (n)· log (1/є)) that є-fool
ordered read-once branching programs (ROBPs) of width 3 and length n. For unordered …

A central question in derandomization is whether randomized logspace (RL) equals
deterministic logspace (L). To show that RL= L, it suffices to construct explicit pseudorandom …

We give the first pseudorandom generators with sub-linear seed length for the following
variants of read-once branching programs (roBPs): 1) First, we show there is an explicit PRG …

We prove that for every decision tree, the absolute values of the Fourier coefficients of given
order t≥ 1 sum to at most (cd/t) t/2 (1+ log n)(t− 1)/2, where n is the number of variables, d is …

A recent work of Chattopadhyay et al.(CCC 2018) introduced a new framework for the
design of pseudorandom generators for Boolean functions. It works under the assumption …

We analyze the Fourier growth, ie the L₁ Fourier weight at level k (denoted L_ {1, k}), of
read-once regular branching programs. We prove that every read-once regular branching …

The query model offers a concrete setting where quantum algorithms are provably superior
to randomized algorithms. Beautiful results by Bernstein-Vazirani, Simon, Aaronson, and …