Pages that link to "Item:Q3588430"
From MaRDI portal
The following pages link to Improved Pseudorandom Generators for Depth 2 Circuits (Q3588430):
Displayed 22 items.
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- A short implicant of a CNF formula with many satisfying assignments (Q727982) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- A Short Implicant of a CNF Formula with Many Satisfying Assignments (Q2942635) (← links)
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs (Q3007622) (← links)
- The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions (Q3012817) (← links)
- Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality (Q3196409) (← links)
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas (Q5002707) (← links)
- (Q5005182) (← 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)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
- (Q5875501) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)