Derandomizing logspace with a small shared hard drive
From MaRDI portal
Cites work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- \(\text{RL}\subseteq \text{SC}\)
- Algorithmic derandomization via complexity theory
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Approximating iterated multiplication of stochastic matrices in small space
- Catalytic approaches to the tree evaluation problem
- Catalytic space: non-determinism and hierarchy
- Certified hardness vs. randomness for log-space
- Computing with a full memory: catalytic space
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Hitting sets give two-sided derandomization of small space
- scientific article; zbMATH DE number 7650313 (Why is no real title available?)
- Near-optimal derandomization of medium-width branching programs
- On pure space vs catalytic space
- On read-once vs. multiple access to randomness in logspace
- Randomized and Symmetric Catalytic Computation
- Reusing space: techniques and open problems
- Sparser Johnson-Lindenstrauss transforms
- Time-space tradeoff in derandomizing probabilistic logspace
Cited in
(3)
This page was built for publication: Derandomizing logspace with a small shared hard drive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866493)
