Pages that link to "Item:Q2931408"
From MaRDI portal
The following pages link to Pseudorandom walks on regular digraphs and the RL vs. L problem (Q2931408):
Displayed 17 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Nonlinear spectral calculus and super-expanders (Q2249432) (← links)
- Space complexity of reachability testing in labelled graphs (Q2316928) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
- In a World of P=BPP (Q3088186) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
- Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
- Space Hardness of Solving Structured Linear Systems. (Q6065465) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)