The following pages link to (Q3191575):
Displayed 11 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← 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)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← 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)
- 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)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)