Pages that link to "Item:Q1102253"
From MaRDI portal
The following pages link to Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253):
Displaying 18 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← 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)
- Rainbow paths (Q965956) (← links)
- Probabilistic encryption (Q1057832) (← links)
- Generating quasi-random sequences from semi-random sources (Q1088641) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- On extractors and exposure‐resilient functions for sublogarithmic entropy (Q4921889) (← links)
