Pages that link to "Item:Q1088641"

The following pages link to Generating quasi-random sequences from semi-random sources (Q1088641):

Displaying 35 items.

• Collapse of PP with a semi-random source to BPP (Q286973) (← links)
• Limits on the usefulness of random oracles (Q290382) (← links)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
• 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)
• The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
• On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
• Improving the Hadamard extractor (Q1758168) (← links)
• Biased random walks (Q1912749) (← links)
• Simulating BPP using a general weak random source (Q1923854) (← links)
• 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
• Santha-Vazirani sources, deterministic condensers and very strong extractors (Q2195575) (← links)
• Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
• Explicit two-source extractors and resilient functions (Q2320598) (← links)
• Smoothed analysis of binary search trees (Q2371805) (← links)
• Deterministic extractors for affine sources over large fields (Q2390150) (← links)
• Extractors from Reed-Muller codes (Q2496317) (← links)
• Semi-device-independent randomness expansion using \(n\rightarrow1\) sequential quantum random access codes (Q2685658) (← links)
• Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources (Q2794527) (← links)
• Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources (Q2956041) (← links)
• An Introduction to Randomness Extractors (Q3012907) (← links)
• Increasing the output length of zero-error dispersers (Q3119044) (← links)
• Average case analysis of fully dynamic reachability for directed graphs (Q3124401) (← links)
• Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (Q3448780) (← links)
• Privacy with Imperfect Randomness (Q3457080) (← links)
• (Q5009525) (← links)
• Extractors for weak random sources and their applications (Q5054851) (← links)
• Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
• A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness (Q6176993) (← links)