Pages that link to "Item:Q4943700"
From MaRDI portal
The following pages link to Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators (Q4943700):
Displaying 50 items.
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- Better short-seed quantum-proof extractors (Q764353) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- Superconcentrators of depths 2 and 3; odd levels help (rarely) (Q1318476) (← links)
- Short lists with short programs in short time (Q1745959) (← links)
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors (Q1928497) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Estimating security of the quantum key distribution from the guesswork (Q2107099) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Optimal sparse designs for process flexibility via probabilistic expanders (Q2795875) (← links)
- Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
- Bounded-Retrieval Model with Keys Derived from Private Data (Q2980861) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- On complexity of linear operators on the class of circuits of depth 2 (Q3184524) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
- Condensed Unpredictability (Q3448859) (← links)
- Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint (Q3460111) (← links)
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Sampling Correctors (Q4577769) (← links)
- Smaller Explicit Superconcentrators (Q4665445) (← links)
- (Q5009525) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
- (Q5092448) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- (Q5121891) (← links)
- (Q5240107) (← links)
- Quantum Authentication and Encryption with Key Recycling (Q5270366) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q5501933) (← links)
- Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? (Q5505474) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- (Q5875519) (← links)
- The size‐Ramsey number of trees (Q5894526) (← links)
- Extractor Lower Bounds, Revisited (Q6084344) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds (Q6566468) (← links)
- Unified view for notions of bit security (Q6605331) (← links)
