BPL-AC^1
From MaRDI portal
Publication:6866460
Cites work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- \(\text{RL}\subseteq \text{SC}\)
- Approximating iterated multiplication of stochastic matrices in small space
- Certified hardness vs. randomness for log-space
- Derandomization with minimal memory footprint
- Error reduction for weighted PRGs against read once branching programs
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- High-precision estimation of random walks in small space
- Hitting sets give two-sided derandomization of small space
- scientific article; zbMATH DE number 1301964 (Why is no real title available?)
- scientific article; zbMATH DE number 549850 (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?)
- scientific article; zbMATH DE number 7701432 (Why is no real title available?)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Near-optimal derandomization of medium-width branching programs
- Pseudodistributions that beat all pseudorandom generators (extended abstract)
- Pseudorandom generators for space-bounded computation
- Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
- Pseudorandomness for network algorithms
- Randomness Buys Depth for Approximate Counting
- Randomness is linear in space
- Simple optimal hitting sets for small-success RL
- Size bounds on low depth circuits for promise majority
- Weighted pseudorandom generators via inverse analysis of random walks and shortcutting
This page was built for publication: \(\mathrm{BPL}\subseteq\mathrm{L}\text{-}\mathrm{AC}^1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866460)
