✦ LIBER ✦

The Operational Meaning of Min- and Max-Entropy

✍ Scribed by Konig, R.; Renner, R.; Schaffner, C.

Book ID: 114641772
Publisher: IEEE
Year: 2009
Tongue: English
Weight: 305 KB
Volume: 55
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2025545

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Min- and Max-Entropy in Infinite Dimensi

Min- and Max-Entropy in Infinite Dimensions

✍ Fabian Furrer; Johan Åberg; Renato Renner 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 329 KB

Duality Between Smooth Min- and Max-Entr

Duality Between Smooth Min- and Max-Entropies

✍ Tomamichel, M.; Colbeck, R.; Renner, R. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 235 KB

Variable operator technique and the min-

Variable operator technique and the min-max theorem

✍ Sambhu Nath Datta 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 98 KB

Min- and Max-Relative Entropies and a Ne

Min- and Max-Relative Entropies and a New Entanglement Monotone

✍ Datta, N. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 240 KB

MIN and MAX operators for trapezoidal fu

MIN and MAX operators for trapezoidal fuzzy intervals

✍ Megri, Faycal; Boukezzoula, Reda 📂 Article 📅 2010 🏛 Emerald (MCB UP ) 🌐 English ⚖ 266 KB

Complexity of the min–max and min–max re

Complexity of the min–max and min–max regret assignment problems

✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 179 KB

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro