Pages that link to "Item:Q3190691"

The following pages link to Pseudorandom Generators for Regular Branching Programs (Q3190691):

Displaying 18 items.

• A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
• Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs (Q3007622) (← links)
• Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
• Interactive Information Complexity (Q3454520) (← links)
• Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
• Interactive Information Complexity (Q4592949) (← links)
• Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
• (Q5092453) (← links)
• Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
• Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
• Amplification and Derandomization without Slowdown (Q5129234) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
• (Q5158498) (← links)
• Optimal $\varepsilon$-Biased Sets with Just a Little Randomness (Q5499738) (← links)
• A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
• (Q5875498) (← links)
• Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)