Publication:5140841
From MaRDI portal
DOI10.4086/toc.2020.v016a007zbMath1462.68034MaRDI QIDQ5140841
Publication date: 17 December 2020
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2020.v016a007
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68W20: Randomized algorithms
11K45: Pseudo-random numbers; Monte Carlo methods
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomness buys depth for approximate counting
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
- Pseudorandom bits for constant depth circuits
- Pseudorandom generators for space-bounded computation
- Improved algorithms via approximations of probability distributions
- Improved pseudorandom generators for combinatorial rectangles
- Randomness is linear in space
- Pseudorandomness for network algorithms
- Pseudorandom Generators for Combinatorial Shapes
- Pseudorandom Bits for Polynomials
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Polylogarithmic Independence Can Fool DNF Formulas
- Pseudorandomness via the Discrete Fourier Transform
- Bounded Independence Plus Noise Fools Products
- Efficient approximation of product distributions
- Bounded Independence versus Symmetric Tests
- Improved pseudorandomness for unordered branching programs through local monotonicity
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
- Pseudorandomness for Read-Once Formulas
