Pages that link to "Item:Q5422492"
From MaRDI portal
The following pages link to Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates (Q5422492):
Displayed 17 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q5009555) (← links)
- (Q5077146) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- (Q5140841) (← links)
- (Q5875501) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)