Pseudorandom generators for unbounded-width permutation branching programs
From MaRDI portal
Cites work
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- High-precision estimation of random walks in small space
- scientific article; zbMATH DE number 7650109 (Why is no real title available?)
- Improved pseudorandom generators for depth 2 circuits
- On deterministic approximation of DNF
- Pseudorandom generators for group products, extended abstract
- Pseudorandom generators for polynomial threshold functions
- Pseudorandom generators for regular branching programs
- Pseudorandom generators for space-bounded computation
- Pseudorandom generators from polarizing random walks
- Pseudorandom walks on regular digraphs and the RL vs. L problem
- Pseudorandomness for network algorithms
- Pseudorandomness for regular branching programs via Fourier analysis
- Undirected connectivity in log-space
- Universal traversal sequences for expander graphs
Cited in
(4)
This page was built for publication: Pseudorandom generators for unbounded-width permutation branching programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229290)
