Pages that link to "Item:Q808707"
From MaRDI portal
The following pages link to Pseudorandom bits for constant depth circuits (Q808707):
Displaying 32 items.
- Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity (Q290244) (← 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)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Negation-limited formulas (Q729897) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- Hardness vs randomness (Q1337458) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- An optimal approximation algorithm for Bayesian inference (Q1402716) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- (Q4612482) (← links)
- (Q5009555) (← links)
- (Q5077146) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- (Q5121889) (← links)
- (Q5140841) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- McCulloch-Pitts Brains and Pseudorandom Functions (Q5380437) (← links)
- (Q5875501) (← links)
