scientific article; zbMATH DE number 7286917
From MaRDI portal
Publication:5140841
DOI10.4086/toc.2020.v016a007zbMath1462.68034OpenAlexW3124301230MaRDI 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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20) Pseudo-random numbers; Monte Carlo methods (11K45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
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
This page was built for publication:
