The complexity of approximating entropy
From MaRDI portal
Publication:3579192
DOI10.1145/509907.510005zbMath1192.94074OpenAlexW2291181759MaRDI QIDQ3579192
Ravi Kumar, Sanjoy Dasgupta, Tuğkan Batu, Ronitt Rubinfeld
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.510005
Related Items
Automation of Quantitative Information-Flow Analysis ⋮ Unnamed Item ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ Testing Monotone Continuous Distributions on High-Dimensional Real Cubes ⋮ On the Complexity of Computational Problems Regarding Distributions