Pages that link to "Item:Q5900934"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900934):
Displaying 33 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Entropy and computation: the Landauer-Bennett thesis reexamined (Q280506) (← links)
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Sharp lower bounds on the extractable randomness from non-uniform sources (Q719242) (← links)
- Comparing notions of computational entropy (Q733747) (← links)
- The word entropy and how to compute it (Q1678349) (← links)
- Predictive models for min-entropy estimation (Q1695888) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Entropy conservation for comparison-based algorithms (Q2077296) (← links)
- Incompressible encodings (Q2096497) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Advice lower bounds for the dense model theorem (Q2828224) (← links)
- The Chain Rule for HILL Pseudoentropy, Revisited (Q2946442) (← links)
- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy (Q2947523) (← links)
- Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
- Modulus Computational Entropy (Q2948262) (← links)
- A Better Chain Rule for HILL Pseudoentropy - Beyond Bounded Leakage (Q2953822) (← links)
- On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- Condensed Unpredictability (Q3448859) (← links)
- A Leakage-Resilient Mode of Operation (Q3627451) (← links)
- Entropy computing via integration over fractal measures (Q4515129) (← links)
- Entropy computations via analytic depoissonization (Q4701360) (← links)
- The Many Entropies in One-Way Functions (Q5021132) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- Nearly optimal pseudorandomness from hardness (Q6551259) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
