Pages that link to "Item:Q1088641"
From MaRDI portal
The following pages link to Generating quasi-random sequences from semi-random sources (Q1088641):
Displayed 15 items.
- Some extremal problems arising from discrete control processes (Q913685) (← links)
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- A note on the influence of an \(\epsilon\)-biased random source (Q1305932) (← links)
- Universal tests for nonuniform distributions (Q1310449) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Biased random walks (Q1912749) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Smoothed analysis of binary search trees (Q2371805) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Average case analysis of fully dynamic reachability for directed graphs (Q3124401) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)