Recursive error reduction for regular branching programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7561738 (Why is no real title available?)
- scientific article; zbMATH DE number 7561753 (Why is no real title available?)
- scientific article; zbMATH DE number 7768373 (Why is no real title available?)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Computational Complexity
- Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
- Error reduction for weighted PRGs against read once branching programs
- High-precision estimation of random walks in small space
- Hitting sets for regular branching programs
- On the power of regular and permutation branching programs
- Pseudodistributions that beat all pseudorandom generators (extended abstract)
- Pseudorandom generators for regular branching programs
- Pseudorandom generators for space-bounded computation
- Pseudorandom generators for width-3 branching programs
- Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
- Pseudorandom walks on regular digraphs and the RL vs. L problem
- Pseudorandomness for network algorithms
- Singular value approximation and sparsifying random walks on directed graphs
- Weighted pseudorandom generators via inverse analysis of random walks and shortcutting
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- \(\text{RL}\subseteq \text{SC}\)
This page was built for publication: Recursive error reduction for regular branching programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906407)
