Pages that link to "Item:Q1208412"
From MaRDI portal
The following pages link to On read-once vs. multiple access to randomness in logspace (Q1208412):
Displaying 10 items.
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- \(\text{RL}\subseteq \text{SC}\) (Q1327590) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Running time analysis of broadcast consensus protocols (Q2233402) (← links)
- On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- (Q5092457) (← links)
