scientific article; zbMATH DE number 7561734
From MaRDI portal
Publication:5092453
DOI10.4230/LIPIcs.CCC.2020.6MaRDI QIDQ5092453
Dean Doron, Pooya Hatami, William M. Hoza
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small-bias is not enough to hit read-once CNF
- Pseudorandom generators for space-bounded computation
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- \(\text{RL}\subseteq \text{SC}\)
- Improved algorithms via approximations of probability distributions
- Randomness is linear in space
- Pseudorandomness for network algorithms
- Pseudorandomness for Regular Branching Programs via Fourier Analysis
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Pseudorandom Generators for Regular Branching Programs
- Improved Pseudorandom Generators for Depth 2 Circuits
- Undirected connectivity in log-space
- Simple Constructions of Almost k-wise Independent Random Variables
- Bounded Independence Plus Noise Fools Products
- Fourier bounds and pseudorandom generators for product tests
- Near-optimal pseudorandom generators for constant-depth read-once formulas
- Simple Optimal Hitting Sets for Small-Success RL
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs
- Pseudorandom generators for width-3 branching programs
- Improved pseudorandomness for unordered branching programs through local monotonicity
- Pseudorandom generators for group products
This page was built for publication: