Pseudorandomness and Fourier-growth bounds for width-3 branching programs
From MaRDI portal
Publication:4591372
Recommendations
- Pseudorandomness and Fourier growth bounds for width-3 branching programs
- Pseudorandomness for regular branching programs via Fourier analysis
- Improved pseudorandomness for unordered branching programs through local monotonicity
- Pseudorandom generators for width-3 branching programs
- Pseudorandom Bits for Oblivious Branching Programs
Cited in
(11)- Paradigms for Unconditional Pseudorandom Generators
- Pseudorandom generators for width-3 branching programs
- Pseudorandomness and Fourier growth bounds for width-3 branching programs
- An Optimal Separation of Randomized and Quantum Query Complexity
- Pseudorandomness for width-2 branching programs
- Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
- Pseudorandomness for regular branching programs via Fourier analysis
- Pseudorandomness for Linear Length Branching Programs and Stack Machines
- scientific article; zbMATH DE number 7561734 (Why is no real title available?)
- Approximating iterated multiplication of stochastic matrices in small space
- A polynomial-time construction of a hitting set for read-once branching programs of width 3
This page was built for publication: Pseudorandomness and Fourier-growth bounds for width-3 branching programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591372)