Pages that link to "Item:Q5419096"

The following pages link to Pseudorandom generators for group products (Q5419096):

Displaying 14 items.

• Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
• Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← 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)
• 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)
• Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
• Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
• (Q5092453) (← links)
• (Q5092476) (← links)
• Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← 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)