Pages that link to "Item:Q3787911"
From MaRDI portal
The following pages link to Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Q3787911):
Displaying 50 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Quantum entanglement and the communication complexity of the inner product function (Q387020) (← links)
- Space lower bounds for online pattern matching (Q390881) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Non-malleable coding against bit-wise and split-state tampering (Q514470) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- Relations between communication complexity classes (Q751811) (← 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)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Universal tests for nonuniform distributions (Q1310449) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Improving the Hadamard extractor (Q1758168) (← links)
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain (Q1822415) (← 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)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- The hardest halfspace (Q1983325) (← links)
- The Paley graph conjecture and Diophantine \(m\)-tuples (Q2010648) (← links)
- Reusable fuzzy extractors for low-entropy distributions (Q2032056) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Multi-source non-malleable extractors and applications (Q2056748) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Improved computational extractors and their applications (Q2129010) (← links)
- No time to hash: on super-efficient entropy accumulation (Q2139648) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- On the restricted isometry property of the Paley matrix (Q2238859) (← links)
- Post-challenge leakage in public-key encryption (Q2257289) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Cancellation-free circuits in unbounded and bounded depth (Q2348031) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
