More on bounded independence plus noise: pseudorandom generators for read-once polynomials
From MaRDI portal
(Redirected from Publication:5140841)
Pseudo-random numbers; Monte Carlo methods (11K45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20)
Recommendations
Cites work
- Bounded independence plus noise fools products
- Bounded independence versus symmetric tests
- Efficient approximation of product distributions
- scientific article; zbMATH DE number 2130678 (Why is no real title available?)
- Improved algorithms via approximations of probability distributions
- Improved pseudorandom generators for combinatorial rectangles
- Improved pseudorandom generators from pseudorandom multi-switching lemmas
- Improved pseudorandomness for unordered branching programs through local monotonicity
- Polylogarithmic independence can fool DNF formulas
- Pseudorandom bits for constant depth circuits
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
- Pseudorandom bits for polynomials
- Pseudorandom generators for combinatorial shapes
- Pseudorandom generators for space-bounded computation
- Pseudorandomness for network algorithms
- Pseudorandomness for Read-Once Formulas
- Pseudorandomness via the discrete Fourier transform
- Randomness buys depth for approximate counting
- Randomness is linear in space
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
- Unconditional pseudorandom generators for low degree polynomials
Cited in
(11)- Pseudorandom bits for polynomials
- Pseudorandom generators for low degree polynomials
- Improved pseudorandom generators for depth 2 circuits
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields
- Pseudorandomness via the discrete Fourier transform
- Bounded independence plus noise fools products
- Near-optimal pseudorandom generators for constant-depth read-once formulas
- Bounded independence plus noise fools products
- scientific article; zbMATH DE number 7250142 (Why is no real title available?)
- Paradigms for Unconditional Pseudorandom Generators
- Pseudorandomness, symmetry, smoothing: I
This page was built for publication: More on bounded independence plus noise: pseudorandom generators for read-once polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140841)
