scientific article; zbMATH DE number 1301964
From MaRDI portal
Publication:4247197
Recommendations
Cited in
(29)- Space-bounded hierarchies and probabilistic computations
- Space bounded computations: Review and new separation results
- Pseudorandom generators for space-bounded computation
- Randomness is linear in space
- How strong is Nisan's pseudo-random generator?
- On derandomizing Yao's weak-to-strong OWF construction
- On recycling the randomness of states in space bounded computation
- On probabilistic space-bounded machines with multiple access to random tape
- Pseudorandom generators for combinatorial checkerboards
- Lower space bounds for randomized computation
- Preserving randomness for adaptive algorithms
- Typically-correct derandomization for small time and space
- Hitting sets give two-sided derandomization of small space
- Pseudorandom bits and lower bounds for randomized Turing machines
- Simple optimal hitting sets for small-success RL
- Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
- Derandomizing isolation in space-bounded settings
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
- scientific article; zbMATH DE number 7768373 (Why is no real title available?)
- Paradigms for Unconditional Pseudorandom Generators
- scientific article; zbMATH DE number 7701432 (Why is no real title available?)
- Near-optimal derandomization of medium-width branching programs
- Approximating iterated multiplication of stochastic matrices in small space
- Pseudorandom generators for sliding-window algorithms
- \(\mathrm{BPL}\subseteq\mathrm{L}\text{-}\mathrm{AC}^1\)
- Pseudodistributions that beat all pseudorandom generators
- Implications of better PRGs for permutation branching programs
- Simplifying Armoni's PRG
- On sums of INW pseudorandom generators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247197)
