Pages that link to "Item:Q3579633"
From MaRDI portal
The following pages link to Polylogarithmic independence fools <i>AC</i> <sup>0</sup> circuits (Q3579633):
Displayed 28 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Interactive proofs for social graphs (Q2102081) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- (Q4612476) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
- (Q4993293) (← links)
- (Q5077146) (← links)
- (Q5090936) (← links)
- (Q5121889) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- (Q5875499) (← links)
- (Q5875501) (← links)
- On the probabilistic degree of OR over the reals (Q6074648) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)
- The work of Mark Braverman (Q6200321) (← links)