Pages that link to "Item:Q3191575"
From MaRDI portal
The following pages link to Pseudorandomness for width-2 branching programs (Q3191575):
Displaying 15 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs (Q3007622) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- (Q5092457) (← links)
- Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← 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)
