Quasi chain rule for min-entropy
From MaRDI portal
Publication:1707982
Recommendations
- Chain Rules for Smooth Min- and Max-Entropies
- Entropy minimization with lattice bounds
- The complexity of estimating min-entropy
- Minimization of entropy functionals
- Maximum entropy derivation of quasi-Newton methods
- Quadratically constrained minimum cross-entropy analysis
- scientific article; zbMATH DE number 4192769
- On entropy minimization and convergence
- Minimal Entropy Approximations and Optimal Algorithms
Cites work
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- A parallel repetition theorem for leakage resilience
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Randomness is linear in space
- Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
Cited in
(3)
This page was built for publication: Quasi chain rule for min-entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707982)