Pages that link to "Item:Q2851892"
From MaRDI portal
The following pages link to Pseudorandomness for Regular Branching Programs via Fourier Analysis (Q2851892):
Displaying 18 items.
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Pseudorandom generators for low sensitivity functions (Q4993293) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- (Q5077146) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← 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)
- (Q5121889) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
- Improved pseudorandomness for unordered branching programs through local monotonicity (Q5230303) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
- Pseudorandom Generators for Read-Once Monotone Branching Programs (Q6090916) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)
