Preserving Randomness for Adaptive Algorithms
From MaRDI portal
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.43MaRDI QIDQ5009539
William M. Hoza, Adam R. Klivans
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1611.00783
Cites Work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution
- Randomness is linear in space
- Pseudorandomness for network algorithms
- On recycling the randomness of states in space bounded computation
- Preserving Statistical Validity in Adaptive Data Analysis
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Learning Decision Trees Using the Fourier Spectrum
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Analysis of Boolean Functions
- Unnamed Item
- Unnamed Item