Pages that link to "Item:Q1094137"
From MaRDI portal
The following pages link to On using deterministic functions to reduce randomness in probabilistic algorithms (Q1094137):
Displaying 11 items.
- On the power of two-point based sampling (Q1120201) (← links)
- Pseudorandom generators for space-bounded computation (Q1204523) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- A simple analysis of the error probability of two-point based sampling (Q1350935) (← links)
- On the second eigenvalue of hypergraphs (Q1842569) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Realistic analysis of some randomized algorithms (Q2277019) (← links)
- Logarithmic reduction of the level of randomness in some probabilistic geometric constructions (Q2491601) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Construction of expanders and superconcentrators using Kolmogorov complexity (Q4500485) (← links)
- Using Rademacher permutations to reduce randomness (Q5440793) (← links)